(New page: Category:2010 Fall ECE 438 Boutin Category:blog =Lecture 9 Blog, ECE302 Spring 2013, Prof. Boutin= Friday January 28, 2013 (Week 4) - See [[LectureScheduleECE...)
 
 
(2 intermediate revisions by 2 users not shown)
Line 3: Line 3:
  
 
=Lecture 9 Blog, [[ECE302]] Spring 2013, [[user:mboutin|Prof. Boutin]]=
 
=Lecture 9 Blog, [[ECE302]] Spring 2013, [[user:mboutin|Prof. Boutin]]=
Friday January 28, 2013 (Week 4) - See [[LectureScheduleECE302Spring13_Boutin|Course Outline]].
+
Monday January 28, 2013 (Week 4) - See [[LectureScheduleECE302Spring13_Boutin|Course Outline]].
  
 
(Other blogs [[Lecture1_blog_ECE302S13_Boutin|1]],
 
(Other blogs [[Lecture1_blog_ECE302S13_Boutin|1]],
Line 36: Line 36:
 
[[Lecture30_blog_ECE302S13_Boutin|30]])
 
[[Lecture30_blog_ECE302S13_Boutin|30]])
 
----  
 
----  
In Lecture 9, ...
+
In Lecture 9, we used the counting principle to obtain three important counting formulas:
 +
*the k-permutation formula
 +
*The k-combination formula
 +
*The set partition formula
 +
This concludes Part 1 of the course material. As per the [[LectureScheduleECE302Spring13_Boutin|Course Outline]], the first exam, on Friday February 8, will be testing your understanding of Part 1 of the course material.  
  
 +
Note that a new [[Bonus_point_2_ECE302_Spring2012_Boutin|bonus point opportunity]] has been posted.
  
 
==Action items for students (to be completed before next lecture)==
 
==Action items for students (to be completed before next lecture)==
 +
*Read section 1.6 in [http://www.athenasc.com/Prob-2nd-Ch1.pdf  Chapter 1] of "[http://www.athenasc.com/probbook.html Introduction to Probability]," by Dimitri P. Bertsekas and John N. Tsitsiklis. Athena Scientific, Belmont, Massachusetts, 2008, ISBN 978-1-886529-23-6.
 +
*Begin working on problems 49-60 in [http://www.athenasc.com/Prob-2nd-Ch1.pdf  Chapter 1] of "[http://www.athenasc.com/probbook.html Introduction to Probability]," by Dimitri P. Bertsekas and John N. Tsitsiklis. Athena Scientific, Belmont, Massachusetts, 2008, ISBN 978-1-886529-23-6.
 +
::Note: These problems will be part of the third homework assignment, which you will have to hand in in class next Monday.
 +
 +
----
 +
==Comments /questions==
 +
*write a comment/question here.
 +
*write another comment/question here.
  
 
Previous: [[Lecture8_blog_ECE302S13_Boutin|Lecture 8]]
 
Previous: [[Lecture8_blog_ECE302S13_Boutin|Lecture 8]]

Latest revision as of 10:12, 28 January 2013


Lecture 9 Blog, ECE302 Spring 2013, Prof. Boutin

Monday January 28, 2013 (Week 4) - See Course Outline.

(Other blogs 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30)


In Lecture 9, we used the counting principle to obtain three important counting formulas:

  • the k-permutation formula
  • The k-combination formula
  • The set partition formula

This concludes Part 1 of the course material. As per the Course Outline, the first exam, on Friday February 8, will be testing your understanding of Part 1 of the course material.

Note that a new bonus point opportunity has been posted.

Action items for students (to be completed before next lecture)

Note: These problems will be part of the third homework assignment, which you will have to hand in in class next Monday.

Comments /questions

  • write a comment/question here.
  • write another comment/question here.

Previous: Lecture 8

Next: Lecture 10


Back to 2013 Spring ECE302 Boutin

Alumni Liaison

Correspondence Chess Grandmaster and Purdue Alumni

Prof. Dan Fleetwood