| 2 | M | Jan 25 | No class - MLK Day observed | ||
| W | Jan 27 | Stable matching | 1.1, 2.3 | ||
| Th | Jan 28 | Graphs review | quiz1 quiz1 solutions |
||
| F | Jan 29 | Greedy algorithms | Chapter 3 | HW1 HW1 solutions |
| 3 | M | Feb 1 | Interval scheduling | ||
| W | Feb 3 | Minimizing lateness | quiz2 quiz2 solutions |
||
| Th | Feb 4 | Minimizing lateness | 4-4.2 | ||
| F | Feb 5 | Shortest paths | HW2 HW2 solutions |
| 4 | M | Feb 8 | Minimum Spanning Trees | quiz3 quiz3 solutions |
|
| W | Feb 10 | KTU Orientation | |||
| Th | Feb 11 | Huffman Codes | 4.4-6 | ||
| F | Feb 12 | Counting Inversions | 4.8 | HW3 HW3 solutions |
| 5 | M | Feb 15 | Closest points | 5-5.3 | |
| W | Feb 17 | Closest points | 5.4 | quiz4 quiz4 solutions |
|
| Th | Feb 18 | Exam 1 Review | |||
| F | Feb 19 | Exam 1 |
| 6 | M | Feb 22 | Multiplication | ||
| W | Feb 24 | Matrix Multiplication | 5.5 | ||
| Th | Feb 25 | Dynamic programming | quiz5 quiz5 solutions |
||
| F | Feb 26 | Weighted Interval Scheduling | Section 6-6.1 | HW4 HW4 solutions |
| 7 | M | Feb 29 | Segmented Least Squares | Section 6.2-6.3 | quiz6 quiz6 solutions |
| W | Mar 2 | Subset sums/Knapsack | Section 6.4 | quiz7 quiz7 solutions |
|
| Th | Mar 3 | Sequence alignment | Section 6.6 | ||
| F | Mar 4 | Matrix chain multiplication | Section 6.7 | Project topic |
| 8 | M | Mar 7 | Bellman-Ford | Section 6.8 | quiz8 quiz8 solutions |
| W | Mar 9 | DP / Feedback | |||
| Th | Mar 10 | DP advanced | quiz9 quiz9 solutions |
||
| F | Mar 11 | DP practice | HW5 HW5 solutions |
| 9 | M to F | Mar 14 to 18 | Spring break |
| 10 | M | Mar 21 | Network Flow | ||
| W | Mar 23 | Network Flow | Project outline | ||
| Th | Mar 24 | Max Flow/Min Cut | Section 7-7.1 | ||
| F | Mar 25 | Exam 2 |
| 11 | M | Mar 28 | Max Flow/Min Cut theorem | Section 7.2 | quiz10 quiz10 solutions |
| W | Mar 30 | Matchings | Section 7.3 | HW6 HW6 solutions |
|
| Th | Mar 31 | Disjoint Paths | Section 7.5 | quiz11 quiz11 solutions |
|
| F | Apr 1 | Reductions | Section 7.6 | HW7 HW7 solutions |
| 12 | M | Apr 4 | Reductions | Section 8-8.2 | |
| W | Apr 6 | Reductions | |||
| Th | Apr 7 | P and NP | quiz12 quiz12 solutions |
||
| F | Apr 8 | NP-completeness | Sections 8.3-8.4 | HW8 HW8 solutions |
| 13 | M | Apr 11 | NP-completeness | ||
| W | Apr 13 | NP-completeness of Independent Set, Vertex Cover, Set Cover, Clique | Project draft | ||
| Th | Apr 14 | NP-completeness of Hamiltonian Cycle, Traveling Salesman | Sections 8.5-8.7 | ||
| F | Apr 15 | NP-completeness of 3-Coloring, Subset Sum | HW9 HW9 solutions |
| 14 | M | Apr 18 | Exhaustive search | ||
| W | Apr 20 | Permutations | Problems on Algorithms, Ch. 10 | Project paper | |
| Th | Apr 21 | Combinations | |||
| F | Apr 22 | Paper workshop |
| 15 | M | Apr 25 | Exam 3 | ||
| W | Apr 27 | Fun day | |||
| Th | Apr 28 | Mulin's presentation / Course Evals | |||
| F | Apr 29 | No class | HW10 (email) |
| 16 | M | May 2 | Course wrapup | Project final | |
| Final Exam, Saturday, May 7, 2-4pm |