| CMSC 641 Design & Analysis of Algorithms, Class Schedule | |||||||
| In-class lecture topics | Asynchronous lecture topics | Textbook Reading | HW Assigned | HW Due | |||
| Thu Aug 27 | Introduction, Greedy algorithms | Greedy: Shoemaker & Elves | 16.1-16.4 | ||||
| Tue Sep 01 | Greedy: Fractional Knapsack | Greedy: Huffman Codes | HW1 | ||||
| Thu Sep 03 | Dynamic Programming: 0-1 Knapsack | DP: Matrix multiplication | 15.1-15.4 | ||||
| Tue Sep 08 | DP: Longest common subsequence | DP: Optimum binary search trees | HW2 | HW1 | |||
| Thu Sep 10 | Amortized Analysis, Dynamic Tables | Skew Heaps | 17.1-17.4 | ||||
| Tue Sep 15 | Splay Trees | wrap up Splay Trees | HW3 | HW2 | |||
| Thu Sep 17 | Disjoint-Set Union | DSU proof | 21.1-21.4 | ||||
| Tue Sep 22 | Fibonacci Heaps | Fib Heap proof | 19.1-19.4 | HW4 | HW3 | ||
| Thu Sep 24 | Quiz 1: greedy | ||||||
| Tue Sep 29 | Network flow intro | Max Flow Min Cut | 26.1-26.3 | HW5 | HW4 | ||
| Thu Oct 01 | Quiz 2: dynamic programming | Edmonds Karp | |||||
| Tue Oct 06 | Max Flow applications | More Max Flow applications | HW6 | HW5 | |||
| Thu Oct 08 | Make-up Quiz A | Max Flow algorithms using Level Graphs | |||||
| Tue Oct 13 | NP completeness | NP completeness | 34.1-34.5 | HW Break | HW6 | ||
| Thu Oct 15 | Quiz 3: amortized analysis | NP completeness | |||||
| Tue Oct 20 | NP completeness | NP completeness | HW7 | ||||
| Thu Oct 22 | Make-up Quiz B | NP completeness | |||||
| Tue Oct 27 | NP completeness | NP completeness | HW8 | HW7 | |||
| Thu Oct 29 | Quiz 4: network flow | NP completeness | |||||
| Tue Nov 03 | Approximation algorithms | Approximation algorithms | 35.1-35.5 | HW9 | HW8 | ||
| Thu Nov 05 | Make-up Quiz C | Approximation algorithms | |||||
| Tue Nov 10 | Approximation algorithms | Approximation algorithms | HW10 | HW9 | |||
| Thu Nov 12 | Quiz 5: NP completeness | Approximation algorithms | |||||
| Tue Nov 17 | Approximation algorithms | HW11 | HW10 | ||||
| Thu Nov 19 | Make-up Quiz D | Linear programming - intro | 29.1-29.3, handout | ||||
| Tue Nov 24 | Randomized algorithms - intro | Linear programming - standard & slack forms | handout | HW Break | HW11 | ||
| Thu Nov 26 | Thanksgiving Break | ||||||
| Tue Dec 01 | Randomized algorithms - MinCut | Linear programming - Simplex method | HW12 | ||||
| Thu Dec 03 | Quiz 6: approximation algorithms | Linear programming - duality | |||||
| Tue Dec 08 | Randomized algorithms - Approx. MaxSAT | HW12 | |||||
| Tue Dec 15 | 3:30pm Make-up Quiz E, 4:30pm Make-up Quiz F (Final Exam time slot) | ||||||
| xxx | |||||||