| | Date | Topic | Reading (CLRS) | Due |
| 1. | 01/12: | Intro & Admin. Karatsuba/Strassen. | | |
| 2. | 01/14: | Asymptotic analysis, solving recurrences | 1-4 | |
| 3. | 01/19: | Probabilistic analysis, Randomized Quicksort | 5,7 | Mini 1 due |
| 4. | 01/21: | Linear-time Selection (randomized and deterministic) | 9 | |
| 5. | 01/26: | Sorting/searching lower bounds | 8.1 | Hwk 1 due |
| 6. | 01/28: | Tight upper/lower bounds II | | |
| 7. | 02/02: | Amortized Analysis | 17 | Mini 2 due |
| 8. | 02/04: | Search trees: B-trees, treaps | 12,18 | |
| 9. | 02/09: | Radix sort, tries + QUIZ | 8 | Hwk 2 pres |
| 10. | 02/11: | Hashing: universal and perfect hashing | 11 | |
| 11. | 02/16: | Dynamic Programming | 15 | Mini 3 due |
| 12. | 02/18: | Graph Algorithms I | 22,23 | |
| 13. | 02/23: | Graph Algorithms II | 21 | Hwk 3 due |
| 14. | 02/25: | Review (optional) | | |
| 15. | 03/02: | MIDTERM | | |
| 16. | 03/04: | Graph Algorithms III | 24,25 | |
| 16. | 03/16: | BFS, DFS, Coloring, Strongly Connected Components | 24,25 | |
| 17. | 03/18: | Network Flows and Matchings I | 26 | |
| 18. | 03/23: | Network Flows and Matchings II | | HW4 pres; Mini 4 cancelled |
| 19. | 03/25: | Linear Programming | 29 | |
| 20. | 03/30: | NP-Completeness I | 34 | |
| 22. | 04/01: | NP-Completeness II | 35 | Hwk 5 due |
| 23. | 04/06: | Approximation Algorithms | | |
| 24. | 04/08: | On-line algorithms+ QUIZ | 31 | |
| 25. | 04/13: | Number-theoretic algs I | | |
| 26. | 04/15: | No class. Spring Carnival | | |
| 26. | 04/20: | Number-theoretic algs II | 30 | Hwk 6 pres |
| 27. | 04/22: | Fast Fourier Transform | | |
| 28. | 04/27: | Machine Learning and Game Theory | | Mini 4 due |
| 29. | 04/29: | Game Theory II (zero-sum & general-sum games) | | |