| M Aug 27 | Introduction (read Chapters 1-2 for background) |
| W Aug 29 | Mixed radix representation, sorting lower bound (Ch. 8) |
| F Aug 31 | Sorting lower bound, asymptotic notations (Ch. 3) |
| M Sep 03 | Asymptotic notations (Ch. 3) |
| W Sep 05 | Divide and Conquer (Ch. 4) |
| F Sep 07 | Divide and Conquer, Strassen's matrix multiplication, Karatsuba's integer multiplication (Ch. 4 and slides) |
| M Sep 10 | Greedy Algorithms, Coin Change (Ch. 16) |
| W Sep 12 | Greedy Algorithms, Matroids (Ch. 16) |
| F Sep 14 | Greedy Algorithms, Matroids (Ch. 16) |
| M Sep 17 | Dynamic Programming |
| W Sep 19 | Dynamic Programming |
| F Sep 21 | Dynamic Programming |
| M Sep 24 | Longest Common Subsequence |
| W Sep 26 | Amortized Analysis |
| F Sep 28 | Amortized Analysis |
| M Oct 01 | Breadth First Search |
| W Oct 03 | Depth First Search |
| F Oct 05 | Topological Sorting, Review |
| M Oct 08 | Midterm Exam |
| W Oct 10 | Strongly Connected Components |
| F Oct 12 | Dijkstra's Single Source Shortest Path Algorithm |
| M Oct 15 | Bellman Ford Algorithm |
| W Oct 17 | Randomized Algorithms |
| F Oct 19 | No classes due to bomb threat |
| M Oct 22 | Randomized Algorithms |
| W Oct 24 | Monte Carlo Methods, Minimum Cut |
| F Oct 26 | Minimum Cut |
| M Oct 29 | Randomized Quicksort |
| W Oct 31 | Hiring Algorithm, Random Permutations |
| F Nov 02 | Hat Problem |
| M Nov 05 | Hat Problem |
| W Nov 07 | P and NP |
| F Nov 09 | NP Completeness |
| M Nov 12 | NP Completeness |
| W Nov 14 | NP Completeness |
| F Nov 16 | NP Completeness, Undecidability |
| M Nov 19 | Undecidability |
| W Nov 21 | Undecidability, Multithreaded Algorithms |
| F Nov 23 | No class |
| M Nov 26 | Multithreaded Algorithms |
| W Nov 28 | Multithreaded Algorithms, Calculus of Finite Differences |
| F Nov 30 | Calculus of Finite Differences |