| Date | Topic | Reading | Assignment | Comments |
|---|
| 2/14 | introduction (.tex), admin | Ch. 1, 2 | assignment 1 (.tex)
clrscode.sty | |
| 2/16 | big-O (ppt) | Ch. 3 | assignment 2 (.tex) | |
| 2/21 | recurrences (ppt) | Ch. 4-4.1, 4.3-4.5 | assignment 3 (.tex) | |
| 2/23 | quicksort, randomized algorithms (ppt) | Ch. 7 | assignment 4 (.tex) | |
| 2/28 | comparison-based sorting (ppt)
linear-time sorting | Ch. 8 | assignment 5 (.tex) | |
| 3/1 | order statistics (ppt)
basic data structures (ppt) | Ch. 9, 10 | assignment 6 (.tex) | |
| 3/6 | amortized analysis, heaps (ppt) | Ch. 6, Ch. 17.1 | assignment 7 | |
| 3/8 | heaps (ppt), binomial heaps (ppt) | Ch. 19-19.3 | assignment 8 (.tex) | |
| 3/13 | binary search trees, B-trees (ppt) | Ch. 12, 18 | assignment 9 (.tex) | |
| 3/15 | disjoint sets | Ch. 21 | assingment 10 (.tex) | |
| 3/20 | review (ppt) | | | |
| 3/22 | hashtables (ppt) | Ch 11, except 11.3.3, 11.5 | | |
| 3/27 | BREAK | | | |
| 3/29 | BREAK | | | |
| 4/3 | greedy algorithms (ppt) | Ch. 16-16.3 | assignment 11 (.tex) | |
| 4/5 | more greedy (ppt), dynamic programming (ppt) | Ch. 15-15.4 | assignment 12 (.tex) | |
| 4/10 | dynamic programming (ppt) | Ch. 15.5 | assignment 13 (.tex) | |
| 4/12 | graph basics (ppt) | Ch. 22 | assignment 14 (.tex) | |
| 4/17 | shortest paths (ppt) | Ch. 24-24.3 | assignment 15 (.tex) | |
| 4/19 | minimum spanning trees (ppt) | Ch. 23 | assignment 16 (.tex) | |
| 4/24 | network flow (ppt) | Ch. 26-26.2 | assignment 17 (.tex) | |
| 4/26 | flow applications (ppt) | Ch. 26.3 | assignment 18 (.tex) | |
| 5/1 | linear programming (ppt) | Ch. 7.1, 7.6, 7.7 from
Dasgupta et. al
Optional: Ch. 29 | assignment 19 (.tex) | |
| 5/3 | string algorithms (ppt) | Ch. 32-32.3 | assignment20 (.tex) | |
| 5/8 | NP-complete (ppt) | Ch. 34 | assignment 21 (.tex) | |
| 5/10 | review (ppt) | | | |