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