This is a tentative daily schedule, and the exact topics for each class may change during the course of the semester.
| Mon, Jan 14 | . | Divide & Conquer: Strassen's matrix multiplication. | Ch 1, 2, 4.2 Notes are now on Piazza |
| Wed, Jan 16 | HW1 out | Asymptotic analysis; recurrences; summations | Ch 2, 3, 4.3, 4.4, Appendix A |
| Wed, Jan 23 | . | Master theorem for recurrences; closest pair | Ch 4.5,4.6, 33.4 |
| Mon, Jan 28 | HW1 in, HW2 out | Graph representation and searching; connected components and strong connectivity; depth-first search | Ch 22; Appendix B.4, B.5 |
| Wed, Jan 30 | Mini-test 1 | Topological sort; breadth-first search; unweighted shortest paths | Ch 22 |
| Mon, Feb 4 | HW2 in, HW3 out | Dynamic programming: LCS | Ch 15.3, 15.4 |
| Wed, Feb 6 | . | Matrix chain multiplication; shortest paths in graphs in graphs | Ch 15, Ch 24 |
| Mon, Feb 11 | HW3 in; HW 4 out | Bellman-Ford SSSP; Floyd Warshall APSP | Ch 24.1, 25 |
| Wed, Feb 13 | . | Greedy algorithms: Activity selection; fractional knapsack | Ch 16 |
| Mon, Feb 18 | HW4 in, HW5 out | Minimum spanning tree; Kruskal's algorithm | Ch 23.1, 23.2 |
| Wed, Feb 20 | Mini-test 2 | Dijkstra's SSSP algorithm | Ch 23.2, 24.3 |
| Mon, Feb 25 | HW5 in | Disjoint sets; Kruskal re-visited | Ch 21, 23.2 |
| Wed, Feb 27 | . | Wrap-up and review for Test 1 | . |
| Mon, Mar 4 | TEST 1 | TEST 1 | . |
| Wed, Mar 6 | HW6 out | Integer sort; lower bound for sorting | Ch 9 |
| Mar 11-15 | No class | Spring Break | . |
| Mon, Mar 18 | . | Undecidability | . |
| Wed, Mar 20 | . | Halting problem; reductions | . |
| Mon, Mar 25 | HW6 in, HW7 out | P, NP; polynomial time reductions | Ch 34.1-34.3 |
| Wed, Mar 27 | . | NP-completeness | Ch 34.3-34.5 |
| Mon, Apr 1 | HW7 in, HW8 out | NP-completeness and approximation Algorithms | Ch 35, 35.1, 35.2 |
| Wed, Apr 3 | Mini-test 3 | Approximation Algorithms | Ch 35 |
| Mon, Apr 8 | HW8 in | Randomized algorithms; Quicksort and randomized Partition | Ch 5; Appendix C.1-C.4; Ch 7 |
| Wed, Apr 11 | . | Randomized selection and randomized Quicksort | Ch 92, Ch 7.1, 7.2 |
| Mon, Apr 15 | TEST 2 | TEST 2 | . |
| Wed, Apr 17 | HW9 out | Hashing | Ch 11 |
| Mon, Apr 22 | . | Amortized analysis; table expansion and contraction | Ch 17 |
| Wed, Apr 24 | HW9 in, HW10 out | Maximum flow | Ch 26.1, 26.2 |
| Mon, Apr 29 | Mini-test 4 | Maximum flow; bipartite matching | Ch 26.2, 26.3 |
| Wed, May 1 | HW10 in | Wrap-up | . |
| FRI, MAY 10, 7-10 | FINAL EXAM | FINAL EXAM IN GDC 1.304 | . |