| Date | Topic | CLRS | KT | Due |
| 1. | 08/30: | Intro & Admin. Karatsuba/Strassen. | | | |
| 2. | 09/01: | Asymptotic analysis, solving recurrences | 1-4 | 2.1-2.2,5.2 | |
| 3. | 09/06: | Probabilistic analysis, Randomized Quicksort | 5,7 | 13.3,13.12 | Mini 1 due |
| 4. | 09/08: | Linear-time Selection (randomized and deterministic) | 9 | 13.5 | |
| 5. | 09/13: | Sorting/searching lower bounds | 8.1 | 2.4 | Hwk 1 due |
| 6. | 09/15: | Tight upper/lower bounds II | | | |
| 7. | 09/20: | Amortized Analysis | 17 | | Mini 2 due |
| 8. | 09/22: | Search trees: B-trees, treaps | 12,18 | | |
| 9. | 09/27: | Radix sort, tries + QUIZ | 8 | | Hwk 2 pres |
| 10. | 09/29: | Hashing: universal & perfect hashing | 11 | 13.6 | |
| 11. | 10/04: | Dynamic Programming (makeup on 10/3) | 15 | 6.1-6.7 | Mini 3 due |
| 12. | 10/06: | Graph Algorithms I | 22,23 | 3 | |
| 13. | 10/11: | Graph Algorithms II | 21 | 4.4,6.8-6.10 | Hwk 3 due |
| 14. | 10/13: | Midterm Review | | | |
| 15. | 10/18: | MIDTERM | | | |
| 16. | 10/20: | Graph Algorithms III | 24,25 | 4.5-4.6 | |
| 17. | 10/25: | Network Flows and Matchings I | 26 | 7 | Hwk 4 pres |
| 18. | 10/27: | Network Flows and Matchings II | | | |
| 19. | 11/01: | Linear Programming | 29 | 11.6 | Mini 4 due |
| 20. | 11/03: | NP-Completeness I | 34 | 8.1-8.3 | |
| 21. | 11/08: | NP-Completeness II | | 8.4-8.10 | Hwk 5 due |
| 22. | 11/10: | Approximation Algorithms | 35 | 11 | |
| 23. | 11/15: | On-line algorithms | | | |
| 24. | 11/17: | Number-theoretic algs I+ QUIZ | 31 | | |
| 25. | 11/22: | Number-theoretic algs II | | | Hwk 6 Pres Mon and Tue |
| 26. | 11/29: | Number-theoretic algs III (FFT) | 30 | 5.6 | |
| 27. | 12/01: | Fair division, envy-free cake-cutting | | | Mini 5 due |
| 28. | 12/06: | Game Theory (zero-sum &
general-sum games) | | 12.7 | |
| 29. | 12/08: | Machine learning algorithms | | | Hwk 7 due |