Lectures
Notes can be printed out before each lecture.
| # | Date | Topic | Pages in book | In 2nd edition | Notes |
|---|---|---|---|---|---|
| 1 | 31/8 | Solving recurrences | 83-96 | 62-75 | |
| 2 | 2/9 | Order statistics | 211-222 | 183-192 | |
| 3 | 7/9 | Red-black trees. Augmenting data structures | 308-322, 337-353 | 273-287, 302-316 | |
| 4 | 9/9 | Dynamic programming I | 359-389 | 323-347 | |
| 5 | 14/9 | Dynamic programming II | 390-403 | 350-362 | |
| 6 | 16/9 | Dynamic programming III | 424-427, 693-699 | 380-383, 629-634 | |
| 7 | 21/9 | Amortized analysis | 451-471 | 405-424 | |
| 8 | 23/9 | Disjoint sets | 561-581 | 498-517 | |
| 9 | 28/9 | Computational geometry | 1014-1043 | 933-961 | |
| 10 | 30/9 | Sorting networks | handout | 704-719 | |
| 11 | 5/10 | String matching | 985-994, 1002-1006 | 906-915, 923-927 | |
| 12 | 7/10 | van Emde Boas trees | 531-556 | ||
| 13 | 12/10 | Summary | |||
| 14 | 14/10 | Last year's exams | exam |
Comments:
Lecture 1:Akra-Bazzi's method for solving recurrences.