| Date | topic | Reading Assignment |
|---|---|---|
| Jan 24 | The Stable Marriage Problem | K & T Chapter 1 |
| Jan 29 | Basics of Algorithm Analysis | K & T Chapter 2 |
| Jan 31 | Divide and Conquer Recurrence Relations | K & T Chapter 5, pp 209-221 |
| Feb 7 | Divide and Conquer Algorithms | K & T Chapter 5, pp 221 - 231 |
| Feb 12 | Sorting Algorithms | Lecture Notes |
| Feb 14 | Divide and Conquer cont. | K & T Chapter 5, pp 209 - 231 |
| Feb 19 | Graphs – Definitions and BFS and DFS | K & T Chapter 3, pp 73 - 94 |
| Feb 21 | Graphs continued | K & T Chapter 3, pp 94 - 104 |
| Feb 26 | Greedy Algorithms | K & T Chapter 4, pp 115-136, 151-157 |
| Feb 28 | Prim & Dijkstra Algorithms | K & T Chapter 4, pp 137-151 |
| Mar 4 | Midterm Exam | Chapters 1, 2, 3, 5 |
| Mar 6 | Greedy Algorithms (cont.) | K & T Chapter 4, pp 158 - 177 |
| mar 26 | Greedy Algorithms (concl.) | K & T Chapter 4 |
| Mar 28 | Dynamic Programming | K & T Chapter 6, pp 251 - 274 |
| Apr 2 | Dynamic Programming (cont.) | K & T Chapter 6, pp 272 - 300 |
| Apr 4 | RNA Folding and Edit Distance | K & T Chapter 6, pp 272 - 278 |
| Apr 9 | Shortest Paths | K & T Chapter 6, pp 290 301 |
| Apr 11 | Network Flow | K & T Chapter 7, pp 337 - 357 |
| Apr 16 | Network Flow | K & T Chapter 7, pp 367 - 384 |
| Apr 18 | Network Flow | K & T Chapter 7, pp 384 - 399 |
| Apr 23 | Project Due Date | Submit pdf file to dropbox |
| Apr 23 | Computational Complexity | K & T Chapter 8, pp 401 - 466 |
| Apr 25 | The Class NP-Complete | K & T Chapter 8, pp 467 - 473 |
| Apr 30 | The Class NP-Complete (cont.) | K & T Chapter 8 and Lecture Notes |
| May 2 | Finish Algorithm Complexity & Review | |
| May 7 | Review |
Exam 1 Review Questions answers to review questions Exam 1 answers
