This is a tentative daily schedule, and the exact topics for each class may change during the course of the semester.
| Mon, Jan 13 | . | Introduction; asymptotic analysis; divide & conquer | Ch 1-3 |
| Wed, Jan 15 | HW1 out | Merge-sort; Strassen's algorithm; recurrences; summations | Ch 4.2-4.4, Appendix A |
| Mon, Jan 20 | . | NO CLASS (Martin Luther King Jr. day) | . |
| Wed, Jan 22 | . | Master theorem for recurrences; closest pair | Ch 4.5,4.6, 33.4 |
| Mon, Jan 27 | HW1 in Fri | Graph representation and searching; connected components and strong connectivity; breadth-first search | Ch 22; Appendix B.4, B.5 |
| Wed, Jan 29 | HW2 out | Depth-first search; topological sort | Ch 22 |
| Mon, Feb 3 | Mini-test 1 | Greedy algorithms: activity selection; fractional knapsack | Ch 16.1, 16.2 |
| Wed, Feb 5 | HW2 in, HW3 out | Minimum spanning tree; Kruskal's algorithm | Ch 23.1, 23.2 |
| Mon, Feb 10 | . | Dijkstra's SSSP algorithm | Ch 24, 24.3, 24.5 |
| Wed, Feb 12 | HW3 in, HW 4 out | Dynamic programming: LCS | Ch 15.3, 15.4 |
| Mon, Feb 17 | Mini-test 2 | Matrix chain multiplication; Bellman-Ford SSSP | Ch 15.2, Ch 24.1 |
| Wed, Feb 19 | HW4 in | All-pairs shortest paths | Ch 25.1, 25.2 |
| Mon, Feb 24 | . | Wrap-up and review for Test 1 | . |
| Wed, Feb 26 | TEST 1 | TEST 1 | TEST 1 |
| Mon, Mar 3 | . | Disjoint sets; Kruskal re-visited | Ch 21.1, 21.3, 23.2 |
| Wed, Mar 5 | HW5 out | Integer sort; lower bound for sorting | Ch 8.1-8.3 |
| Mar 10-14 | No class | Spring Break | . |
| Mon, Mar 17 | . | P, NP; polynomial time reductions | Ch 34.1-34.3 |
| Wed, Mar 26 | HW5 in, HW6 out | NP-completeness | Ch 34.3-34.5 |
| Mon, Mar 24 | Mini-test 3 | Undecidability | . |
| Wed, Mar 19 | HW6 in, HW7 out | Halting problem | . |
| Mon, Mar 31 | . | Randomized algorithms; Quicksort and randomized partition | Ch 5; Appendix C.1-C.4; Ch 7.1-7.3 |
| Wed, Apr 2 | HW7 in, HW8 out | Randomized selection and randomized Quicksort | Ch 9.2, Ch 7.4 |
| Mon, Apr 7 | Mini-test 4 | Universal hashing | Ch 11.1-11.3 |
| Wed, Apr 9 | HW8 in | Amortized analysis; table expansion and contraction | Ch 17 |
| Mon, Apr 14 | . | LP definition; wrap-up and review for Test 2 | Ch 29 |
| Wed, Apr 16 | TEST 2 | TEST 2 | TEST 2 |
| Mon, Apr 21 | . | NP-completeness and approximation algorithms | Ch 35, 35.1, 35.2 |
| Wed, Apr 23 | HW9 out | Approximation algorithms | Ch 35 |
| Mon, Apr 28 | . | Maximum flow; bipartite matching | Ch 26.1-26.3 |
| Wed, Apr 30 | HW9 in | Wrap-up | . |
| FRI, MAY 9, 7-10 | FINAL EXAM | FINAL EXAM | FINAL EXAM |