Course Schedule
| Week of: | Tuesday | Thursday |
|---|---|---|
| Jan 29 & 31 |
Course Intro and Review |
Review |
| Feb 5 & 7 |
Review |
Basic Graph Review |
| Feb 12 & 14 | Depth-First Search |
Biconnectivity |
| Feb 19 & 21 | Greedy Algorithms |
Greedy Algorithms |
| Feb 26 & 28 | Greedy Graph Algorithms |
Greedy Graph Algorithms |
| Mar 4 & 6 | Dynamic Programming |
Dynamic Programming |
| Mar 11 & 13 | Dynamic Programming |
Dynamic Programming |
| Mar 18 & 20 | Spring Break | Spring Break |
| Mar 25 & 27 | Dynamic Programming |
Review for the Midterm |
| Apr 1 & 3 | Midterm Exam | Network Flows
|
| Apr 8 & 10 | Network Flows
|
Network Flows |
| Apr 15 & 17 | NP-Completeness |
NP-Completeness |
| Apr 22 & 24 | NP-Completeness |
NP-Completeness |
| Apr 29 & May 1 | NP-Completeness |
Approximation Algorithms |
| May 6 & 8 | Approximation Algorithms |
Approximation Algorithms |
| May 13 | Review for the Final |
Final Exam: Fri, May 16, 8-10am |
Midterm Exam
The mideterm exam will be Tuesday, Apr 1 in class. The exam will be closed-book, closed-notes, but you are allowed one "cheat-sheet", front and back.
Final Exam
The final exam will be Friday, May 16, 8:00-10:00 am. More information will be forthcoming.