| Week | Day | Date | Topic | Reading Due | HW Due |
| 1 | M | January 16 | Introduction, Project Overview | | |
| T | January 17 | Closest pair D & C algorithm | 33.4 | |
| W | January 18 | Randomized selection | 9.1-9.2 | |
| F | January 20 | Median-of-medians selection | 9.3 | |
| 2 | M | January 23 | MLK Day - No Class | | |
| T | January 24 | Median-of-medians time complexity | | HW 1 | point.h | pointset.h | testcp.cc |
| W | January 25 | Graph representations and Breadth First Search | 22.1-22.3 | |
| F | January 27 | Depth first search | | Research problem |
| 3 | M | January 30 | Topological sort | 22.4 | |
| T | January 31 | Correctness of topologial sort | | |
| W | February 1 | Strongly connected components | 22.5 | |
| F | February 3 | Assembly line scheduling (dynamic programming) | 15.1 | HW 2 (D & C) |
| 4 | M | February 6 | Assembly line scheduling | | |
| T | February 7 | Matrix chain multiplication | 15.2-3 | |
| W | February 8 | Matrix chain multiplication | | Research problem overview |
| F | February 10 | Short research talks | | |
| 5 | M | February 13 | Sequence alignment | 15.4 (related) | HW 3 (BFS/DFS) |
| T | February 14 | Talk about homework 4 | | |
| W | February 15 | Activity selection (greedy algorithms) | 16.1 | |
| F | February 17 | Activity selection | | |
| 6 | M | February 20 | Knapsack problem | 16.2 | |
| T | February 21 | Homework questions | | |
| W | February 22 | Scheduling jobs to minimize average completion time | | HW 4 (DP) |
| F | February 24 | Exam 1 | | |
| 7 | M | February 27 | | | |
| T | February 28 | Huffman coding | 16.3 | |
| W | March 1 | No class | | |
| F | March 3 | No class | | |
| 8 | M | March 6 | Minimum spanning trees | 23.1 | HW 5 (Greedy) |
| T | March 7 | Kruskal's MST algorithm | 23.2 | |
| W | March 8 | Prim's MST algorithm | 23.2 | |
| F | March 10 | Disjoint set data structure | 21.1-21.3 | |
| | March 13-17 | Spring Break | | |
| 9 | M | March 20 | Paper work session | | |
| T | March 21 | Bellman-Ford single source shortest path algorithm | 24.1 | |
| W | March 22 | Dijkstra's single source shortest path algorithm | 24.2-24.3 | Paper draft 1 |
| F | March 24 | Correctness of Dijkstra's algorithm | | |
| 10 | M | March 27 | All pairs shortest paths problem | 25.1-25.2 | |
| T | March 28 | Floyd-Warshall all pairs shortest paths algorithm | | |
| W | March 29 | Intro to complexity and NP-completeness | Chapter 34, handout | HW 6 (Graphs) |
| F | March 31 | Encodings and formal languages | | |
| 11 | M | April 3 | Review for exam | | Paper draft 2 |
| T | April 4 | Verification algorithms, NP, and NPC | | |
| W | April 5 | Exam 2 | | |
| F | April 7 | NP-complete problems: SAT (Cook's theorem), 3SAT, Clique | | |
| 12 | M | April 10 | NP-completeness proofs: 3SAT <= Clique | | |
| T | April 11 | NP-completeness proofs: Clique <= Vertex cover | | |
| W | April 12 | NP-completeness proofs: 3D matching <= Partition | | |
| F | April 14 | Backtracking algorithms | | |
| 13 | M | April 17 | LISP | | |
| T | April 18 | LISP | | Final paper |
| R | April 20 | Jason Salazer-Adams: "On-Line Deterministic Scheduling Algorithms for Parallel Machines" | | |
| F | April 21 | No class (Academic Awards Convocation) | | HW 7 (NPC & BT) |
| 14 | M | April 24 | Jeff Camealy: "The RA Scheduling Problem" | | |
| T | April 25 | Nicole Scholtz: "Reinforcement Learning" | | |
| W | April 26 | Robey Holderith: "3D Lighting Algorithms" | | |
| F | April 28 | Aaron Jackson: "Quantum Algorithms" | | LISP HW |
| M | May 1 | Review for Final Exam | | Final final paper |
| M | May 8 | Final Exam (2:00 pm) | | |
