Homework | |||||
---|---|---|---|---|---|
Date | Topic | Quizzes | Reading | Assign | Due |
Thu 08/28 | Introduction, Proof by Induction | 1.1-3.2 | HW1 | ||
Tue 09/02 | Summations | A.1-A.2 | |||
Thu 09/04 | Recurrences | 4.1-4.2 | HW2 | HW1 | |
Tue 09/09 | Master Theorem | 4.3-4.4 | |||
Thu 09/11 | Heapsort | 6.1-6.5 | HW3 | HW2 | |
Tue 09/16 | Quicksort | Quiz 1 | 7.1-7.4 | ||
Thu 09/18 | Lower bounds on Sorting | 8.1-8.4 | HW4 | HW3 | |
Tue 09/23 | Linear-Time Selection | 9.1-9.3 | |||
Thu 09/25 | Dynamic Programming I | 15.1-15.3 | HW5 | HW4 | |
Tue 09/30 | Dynamic Programming II | Quiz 2 | 15.4-15.5 | ||
Thu 10/02 | Greedy Algorithms I | 16.1-16.2 | HW6 | HW5 | |
Tue 10/07 | Greedy Algorithms II | 16.3 | |||
Thu 10/09 | Dynamic Programming vs Greedy | HW7 | HW6 | ||
Tue 10/14 | Dynamic Programming vs Greedy | Quiz 3 | |||
Thu 10/16 | Basic Graph Algorithms I | 22.1-22.2 | HW8 | HW7 | |
Tue 10/21 | Basic Graph Algorithms II | 22.3-22.5 | |||
Thu 10/23 | Minimum Spanning Trees | 23.1-23.2 | HW9 | HW8 | |
Tue 10/28 | Disjoint Set Union | Quiz 4 | 21.1-21.3 | ||
Thu 10/30 | Shortest Paths I | 24.1-24.3 | HW10 | HW9 | |
Tue 11/04 | Shortest Paths II | 24.4-24.5 | |||
Thu 11/06 | Shortest Paths III | 25.1-25.3 | HW11 | HW10 | |
Tue 11/11 | Maximum Flow I | Quiz 5 | 26.1-26.3 | ||
Thu 11/13 | Maximum Flow II | HW12 | HW11 | ||
Tue 11/18 | Hash Tables | 11.1-11.5 | |||
Thu 11/20 | TBA | HW13 | HW12 | ||
Tue 11/25 | TBA | ||||
Thu 11/27 | Thanksgiving break | ||||
Tue 12/02 | NP-completeness | Quiz 6 | 34.1-34.5 | ||
Thu 12/04 | NP-completeness | HW13 | |||
Tue 12/09 | Review | ||||
Tue 12/16 | Final Exam 1pm – 3pm |