| M | Aug 29 | Introduction |
| W | Aug 31 | Asymptotic Notations |
| F | Sep 02 | Asymptotic Notations, Sorting Lower Bound |
| M | Sep 05 | Sorting Lower Bound, Greedy Algorithms |
| W | Sep 07 | Greedy Algorithms and Matroids |
| F | Sep 09 | Greedy Algorithms, Kruskals Minimum Spanning Tree Algorithm |
| M | Sep 12 | Greedy Algorithms for Matroids |
| W | Sep 14 | Dynamic Programming |
| F | Sep 16 | Dynamic Programming |
| M | Sep 19 | Divide-and-Conquer, Recurrence Relations |
| W | Sep 21 | Design Methods Review |
| F | Sep 23 | Longest Common Subsequences |
| M | Sep 26 | Amortized Analysis |
| W | Sep 28 | Amortized Analysis |
| F | Sep 30 | Graph Algorithms, BFS |
| M | Oct 03 | Graph Algorithms, DFS |
| W | Oct 05 | Graph Algorithms, Topological Sorting, SCCs |
| F | Oct 07 | Review of homework problems |
| M | Oct 10 | Midterm exam |
| W | Oct 12 | Class canceled |
| F | Oct 14 | Single Source Shortest Path Algorithms |
| M | Oct 17 | Single Source Shortest Path Algorithms |
| W | Oct 19 | Basics of Probability Theory |
| F | Oct 21 | Randomized Minimum Cut Algorithm |
| M | Oct 24 | Random Variables, Expectations, Indicator Random Variables |
| W | Oct 26 | Randomized Quicksort |
| F | Oct 28 | Q&A with Mike Fossum |
| M | Oct 31 | Monte Carlo Method, Concentration inequalities |
| W | Nov 02 | Randomized Median Computation |
| F | Nov 04 | Randomized Median Computation |
| M | Nov 07 | P vs. NP |
| W | Nov 09 | Satisfiability |
| F | Nov 11 | 3SAT |
| M | Nov 14 | Vertex Cover |
| W | Nov 16 | TSP, HC, Clique |
| F | Nov 18 | Approximation Algorithms |
| M | Nov 21 | Approximation Algorithms |
| W | Nov 23 | No class |
| F | Nov 25 | No class |
| M | Nov 28 | Undecidability |
| W | Nov 30 | Undecidability |
| F | Dec 02 | Review |