| Study Guide | Topic | Date Distributed |
| Study Guide 1 | Asymptotic Notation, Recurrences, Divide and Conquer | Jan. 25 |
| Study Guide 2 | Dynamic Programming | Feb. 08 |
| Study Guide 3 | Greedy Algorithms | Feb. 15 |
| Study Guide 4 | NP-Completeness | Mar. 17 |
| Study Guide 5 | Approximation Algorithms | Mar. 19 |
| Study Guide 6 | Linear Programming and Computational Geometry | April 26 |
