| Date | Handout |
|---|---|
| Jul 23 | Lecture notes: Network flows made simple (heavily based on the textbook - version: Dec. 1, 2005) [pdf] |
| Jul 22 | Assignment 4 [pdf] |
| Jul 12 | Assignment 3 [pdf] |
| Jul 8 | Lecture notes: Pseudo-polynomial time algorithms and Dynamic Programming [pdf] |
| Jun 18 | Lecture notes: greedy approximation and exchange lemmas [pdf] |
| Jun 15 | Master theorem for recurrence relations [pdf] |
| Jun 15 | Lecture notes: Some remarks on Divide and Conquer algorithms[pdf] |
| Jun 11 | Assignment 2 [pdf] |
| May 29 | Lecture notes: Greedy algorithms and Local Exchange Lemmas [pdf] |
| May 28 | Lecture notes: Constructing families of inputs [pdf] |
| May 28 | Assignment 1 [pdf] |
| May 22 | Bonus for assignment 1 [pdf] |
| May 12 | Lecture notes: Basic Counting [pdf] |
| May 8 | Preparation for the optional test [contact course instructor] |
| May 6 | Course outline [pdf] |