| Class | Topic | Homework | Exam |
|---|---|---|---|
| 1: Tue Aug 22 |
Introduction | ||
| 2: Thu Aug 24 |
Asymptotic Notation | ||
| 3: Tue Aug 29 |
Analyzing Iterative Algorithms | ||
| 4: Thu Aug 31 |
Graphs | HW #1 due over weekend | |
| 5: Tue Sep 5 |
Analyzing Recursive Algorithms (I) | ||
| 6: Thu Sep 7 |
Analyzing Recursive Algorithms (II) | HW #2 due over weekend | |
| 7: Tue Sep 12 |
The Correctness of Algorithms (I) | ||
| 8: Thu Sep 14 |
The Correctness of Algorithms (II) | HW #3 due over weekend | |
| 9: Tue Sep 19 |
Divide & Conquer Algorithms (I) | ||
| 10: Thu Sep 21 |
Divide & Conquer Algorithms (II) | HW #4 due over weekend | |
| 11: Tue Sep 26 |
Review and Catch Up | ||
| 12: Thu Sep 28 |
Exam #1 | ||
| 13: Tue Oct 3 |
Dynamic Programming (I) | ||
| 14: Thu Oct 5 |
Dynamic Programming (II) | HW #5 due over weekend | |
| 15: Tue Oct 10 |
Dynamic Programming (III) | ||
| 16: Thu Oct 12 |
Depth-First Search | HW #6 due over weekend | |
| 17: Tue Oct 17 |
Randomized Algorithms (I) | ||
| 18: Thu Oct 19 |
Randomized Algorithms (II) | HW #7 due over weekend | |
| 19: Tue Oct 24 |
Greedy Algorithms (I) | ||
| 20: Thu Oct 26 |
Greedy Algorithms (II) | HW #8 due over weekend | |
| 21: Tue Oct 31 |
Review and Catch Up | ||
| 22: Thu Nov 2 |
Exam #2 | ||
| 23: Tue Nov 7 |
Hard Problems (I) | ||
| 24: Thu Nov 9 |
Hard Problems (II) | HW #9 due over weekend | |
| 25: Tue Nov 14 |
Approximation Algorithms | ||
| 26: Thu Nov 16 |
Heaps | HW #10 due over weekend | |
| 27: Tue Nov 28 |
Perspectives on Sorting | ||
| 28: Thu Nov 30 |
Lower Bounds | HW #11 due over weekend | |
| 29: Tue Dec 5 |
Union-Find Structures | ||
| 30: Thu Dec 7 |
Review and Catch Up | ||
| Fri Dec 15 |
Final Exam 2:00--3:50pm |