| Date | Topic | Reading | Slides | Lecture Videos | |
|---|---|---|---|---|---|
| Jan 14 | Stable Matching | KT 1.1 | Lecture 1 | N/A | |
| Jan 16 | Stable Matching | KT 1.1 | Lecture 2 | Lecture viedo from spring 2024 | |
| Jan 21 | Representative Problems / Running Time Analysis | KT 1.2, 2.1, 2.2 | Lecture 3, additional read | Lecture viedo for online class | |
| Jan 23 | Running Time Analysis | KT 2.2, 2.4 | Lecture 4 | Lecture viedo from spring 2024 | |
| Jan 28 | Running Time Analysis | KT 2.2, 2.4 | Lecture 5 | Available at Blackboard | |
| Jan 30 | Graph | KT 3.1, 3.2, 3.3 | Lecture 6 | Avaialble at Blackboard | |
| Feb 4 | BFS | KT 3.2, 3.3, 3.4 | Lecture 7 | Lecture viedo from spring 2024 | |
| Feb 6 | DFS / Topological Ordering | KT 3.5, 3.6 | Lecture 8 | Lecture viedo from spring 2024 | |
| Feb 11 | Topological Ordering / Interval Scheduling | KT 3.6, 4.1 | Lecture 9 | ||
| Feb 13 | Interval Scheduling | KT 4.1 | Lecture 10 | ||
| Feb 18 | Interval Partitioning | KT 4.1, 4.2 | Lecture 11 | ||
| Feb 20 | Lateness Maximization | KT 4.2, 4.4 | Lecture 12 | ||
| Feb 25 | Shortest Path / MST | KT 4.4, 4.5 | Lecture 13 | ||
| Feb 27 | MST / Midterm Review | Lecture 14 | |||
| Mar 4 | Merge Sort / Counting Inversions | KT 5.1, 5.3 | Lecture 15 | ||
| Mar 6 | Midterm Exam | ||||
| Mar 11 | Counting Inversions / Master Theorem | KT 5.2, 5.3 | Lecture 16 | ||
| Mar 13 | Master Theorem / Binary Search | KT 5.2 | Lecture 17 | ||
| Mar 18 | Closest Points | KT 5.4 | Lecture 18 | ||
| Mar 20 | Integer/Matrix Multiplication | KT 5.5 | Lecture 19 | ||
| April 1 | Weighted Inteverl Scheduing | KT 6.1 | Lecture 20 | ||
| April 3 | Weighted Inteverl Scheduing / Segmented Least Squares | KT 6.1, 6.2, 6.3 | Lecture 21 | ||
| April 8 | Segmented Least Squares / Knapsack | KT 6.3, 6.4 | Lecture 22 | ||
| April 10 | String Alignment / Negative Shortest Path | KT 6.6, 6.8 | Lecture 23 | ||
| April 15 | Negative Shortest Path / Polynomial Reduction | KT 8.1 | Lecture 24 | ||
| April 17 | Polynomial Reduction | KT 8.1 | Lecture 25 | ||
| April 22 | Polynomial Reduction / P and NP | KT 8.1, 8.3 | Lecture 26 | ||
| April 23 | NP / NP-Complete | KT 8.3, 8.4 | Lecture 27 | ||
| April 29 | NP-Complete, Approximation and Randomized Algorithms | KT 8.4, 11, 13 | Lecture 28 | ||
| May 1 | Final Exam Review | Lecture 29 |