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