CSE 21: Mathematics for Algorithm and System Analysis (Summer, 2005)

Home | Syllabus | Schedule | Exams | Homework

Copies of the slides will be posted the day before class. Inked slides (marked up with my notes during class) are available live (and are also archived). The password is "cse21". Important note: don't count on those inked slides always being available: technical glitches can and do occur, so take notes yourself during class.

Schedule

Day Topic Reading in Tucker Reading in Bender
Day 1 (Slides) Basic enumeration and Counting Chapter 5, Sections 1-2 Unit CL, Section 1-2
Day 2 (Slides) Basic enumeration and Counting Chapter 5, Sections 3-5 Unit CL, Sections 3
Day 3 (Slides) Inclusion/Exclusion, Elementary applied discrete probability Chapter 8 Unit CL, Section 4
Day 4 (Slides) Midterm 1, Functions Unit FN, Sections 1-2
Day 5 (Slides) Functions Unit FN, Sections 3-4
Day 6 (Slides) Decision Trees Unit DT, Sections 1, 3
Day 7 (Slides) Recurrence Relations Chapter 7: sections 1-4 Unit DT, Section 4
Day 8 (Slides) Midterm 2 (50 minutes), Generating Functions Chapter 6: sections 1-4
Day 9 (Slides) Graph Theory, Asymptotic notation Chapters 1-2 Unit GT, Sections 1-4
Day 10 Final