| Class | Date | Day | Topic | Reading | Activity | |
| 1 | 8/28 | Tue | Overview,Example | |||
| 2 | 8/30 | Thu | Asymptotics, Recurrences | 1-4 | Asst 1 Ready | |
| 3 | 9/4 | Tue | Probabilistic analysis | 5, 7 | ||
| 4 | 9/6 | Thu | Selection | 9 | ||
| 5 | 9/11 | Tue | Lower Bounds | 8.1 | Asst 1 Due | |
| 6 | 9/13 | Thu | Dynamic Programming | 15 | Asst 2 Ready | |
| 7 | 9/18 | Tue | Balanced Trees | 12, 18 | ||
| 8 | 9/20 | Thu | Amortized Analysis | 17 | Quiz 1 (topics through DP) | |
| 9 | 9/25 | Tue | Splay Trees | Asst 2 Due | ||
| 10 | 9/27 | Thu | Radix Structures | 8 | Asst 3 Ready | |
| 11 | 10/2 | Tue | Hashing 1 | 11 | ||
| 12 | 10/4 | Thu | Hashing 2 | |||
| 13 | 10/9 | Tue | Graph 1 | 22, 23 | Asst 3 Due | |
| 14 | 10/11 | Thu | Union-Find | 21 | Asst 4 Ready | |
| 15 | 11/16 | Tue | Graph Exploration, Matrix Algebra | 24, 25 | ||
| 16 | 10/18 | Thu | Midterm | |||
| 17 | 10/23 | Tue | Strongly Connected Components | 22.5 | Asst 4 Due | |
| 18 | 10/25 | Thu | Max Flow 1 | 26 | Asst 5 Ready | |
| 19 | 10/30 | Tue | Max Flow 2 | |||
| 20 | 11/1 | Thu | Linear Programming | 29 | ||
| 21 | 11/6 | Tue | NP 1 | 34 | Asst 5 Due | |
| 22 | 11/8 | Thu | NP 2 | Asst 6 Ready | ||
| 23 | 11/13 | Tue | Approximation Algorithms | 35 | ||
| 24 | 11/15 | Thu | Number Theory 1 | 31 | Quiz 2 | |
| 25 | 11/20 | Tue | Number Theory 2 | Asst 6 Due | ||
| 26 | 11/27 | Tue | FFT | 30 | ||
| 27 | 11/29 | Thu | TBD 1 | Asst 7 Ready | ||
| 28 | 12/4 | Tue | TBD 2 | |||
| 29 | 12/6 | Thu | TBD 3 | |||
| 30 | 12/11 | Tue | Review | Asst 7 Due | ||
| 12/19 | Final (1-4pm) |
The reading assignments all refer to CLRS, "Introduction to Algorithms"