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)
- Read section 1.6 in Chapter 1 of "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 Chapter 1 of "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: Lecture 8
Next: Lecture 10
