| Date | Topic | Reading | Due |
| 1. 08/26: | Intro & Admin. Karatsuba/Strassen. | | |
| 2. 08/28: | Asymptotic analysis, solving recurrences | 1-4 | |
| 3. 09/02: | Probabilistic analysis, Randomized Quicksort | 5,7 | Mini 1 due |
| 4. 09/04: | Linear-time Selection (rand and det) | 9 | |
| 5. 09/09: | Sorting Lower bounds (det and rand) | 8.1 | Hwk 1 due |
| 6. 09/11: | More sorting/searching lower bounds | | |
| 7. 09/16: | Amortized Analysis | 17 | Mini 2 due |
| 8. 09/18: | Balanced search trees: B-trees | 12,18 | |
| 9. 09/23: | Radix sort, tries + QUIZ | 8 | Hwk 2 pres |
| 10. 09/25: | Hashing I (universal & perfect hashing) | 11 | |
| 11. 09/30: | Hashing II (universal & perfect hashing, cont) | | Mini 3 due |
| 12. 10/02: | Dynamic Programming | 15 | |
| 13. 10/07: | Graph Algorithms I | 22,23 | Hwk 3 due |
| 14. 10/09: | Union-Find | 21 | |
| 15. 10/14: | Graph Algorithms II | 24,25 | |
| 16. 10/16: | MIDTERM | | |
| 17. 10/21: | On-line algorithms | 26 | Hwk 4 pres |
| 18. 10/23: | Network Flows and Matchings I | | |
| 19. 10/28: | Network Flows and Matchings II | 29 | Mini 4 due |
| 20. 10/30: | Linear Programming | 34 | |
| 21. 11/04: | NP-Completeness I | | Hwk 5 due |
| 22. 11/06: | NP-Completeness II | 35 | |
| 23. 11/11: | Approximation Algorithms | 31 | |
| 24. 11/13: | Number-theoretic algs I+ QUIZ | | |
| 25. 11/18: | Number-theoretic algs II | 30 | Hwk 6 pres |
| 26. 11/20: | Fast Fourier Transform |
| 27. 11/25: | Machine learning algorithms | | Mini 5 due |
| 28. 12/02: | TBD | | |
| 29. 12/04: | Cake cutting and fair division | | Hwk 7 due |