| Day | Time | Place | SPCD | Activity |
|---|---|---|---|---|
| Tue, June 24 | 1:15p-3:05p | Gates B03 | Live E4 | Lecture: introduction: general information (on-line), overview (1.1-1.2) math review (3), probability (6.1-6.4, 6.6), asymptotics (2) |
| Tue, June 24 | 3:30p-4:30p | Gates 381 | Office hours: Toli | |
| Thu, June 26 | 1:15p-3:05p | Gates B03 | Live E4 | Lecture: algorithm analysis and divide-and-conquer methods: insertion sort (1.2), merge sort (1.3), recurrences (4.1-4.3), quicksort (8.1-8.2, 8.4.1), maximum subsequence sum problem (handout 5) |
| Thu, June 26 | 3:30p-4:30p | Gates 381 | Office hours: Toli | |
| Mon, June 30 | 11:00a-12:15p | Gates B03 | Live E3 | Problem session |
| Mon, June 30 | 12:30p-2:30p | Gates 193A | Office hours: Aristides | |
| Tue, July 1 | 1:15p-3:05p | Gates B03 | Live E4 | Lecture: sorting and Las Vegas algorithms: randomized quicksort (8.3, 8.4.2), sorting in linear time (9.1-9.3), eight queens problem (handout 7) |
| Tue, July 1 | 3:05p | Gates B03 | Problem set 1 due | |
| Tue, July 1 | 3:30p-4:30p | Gates 381 | Office hours: Toli | |
| Tue, July 1 | 5:00p | On-line | Registration form due | |
| Thu, July 3 | 1:15p-3:05p | Gates B03 | Live E4 | Lecture: randomized quicksort (handout 6), bucket sort (9.4), order statistics (10), hashing (12.1-12.3) |
| Thu, July 3 | 3:30p-4:30p | Gates 381 | Office hours: Toli | |
| Mon, July 7 | 11:00a-12:15p | Gates B03 | Live E3 | Problem session |
| Mon, July 7 | 12:30p-2:30p | Gates 193A | Office hours: Aristides | |
| Tue, July 8 | Noon-1:00p | Gates 381 | Office hours: Toli | |
| Tue, July 8 | 1:15p-3:05p | Gates B03 | Live E4 | Lecture: open addressing (12.4), basic heaps (7), binomial heaps (20) |
| Tue, July 8 | 3:05p | Gates B03 | Problem set 2 due | |
| Thu, July 10 | 1:15p-3:05p | Gates B03 | Live E4 | Lecture: skip lists and trees: randomized skip lists (handout 9), deterministic skip lists (handout 10), basic trees (13.1-13.3), red/black trees (14.1-14.3), treaps (handout 11), splay trees (handout 12) |
| Thu, July 10 | 3:30p-4:30p | Gates 381 | Office hours: Toli | |
| Mon, July 14 | 11:00a-12:15p | Gates B03 | Live E3 | Problem session |
| Mon, July 14 | 12:30p-2:30p | Gates 193A | Office hours: Aristides | |
| Tue, July 15 | Noon-1:00p | Gates 381 | Office hours: Toli | |
| Tue, July 15 | 1:15p-3:05p | Gates B03 | Live E4 | Lecture: red/black tree deletion (14.4), augmenting data structures (15.2), dynamic order statistics (15.1), interval trees (15.3) |
| Tue, July 15 | 3:05p | Gates B03 | Problem set 3 due | |
| Thu, July 17 | 1:15p-3:05p | Gates B03 | Live E4 | Lecture: dynamic programming (16.2): optimal binary search trees (handout 15), matrix chain multiplication (16.1), optimal polygon triangulation (16.4), least common subsequence problem (16.3) |
| Thu, July 17 | 3:30p-4:30p | Gates 381 | Office hours: Toli | |
| Mon, July 21 | 11:00a-12:15p | Gates B03 | Live E3 | Problem session |
| Mon, July 21 | 12:30p-2:30p | Gates 193A | Office hours: Aristides | |
| Tue, July 22 | Noon-1:00p | Gates 381 | Office hours: Toli | |
| Tue, July 22 | 1:15p-3:05p | Gates B03 | Live E4 | Lecture: greedy algorithms (17.2): activity selection (17.1), the knapsack problems (handout 16), Huffman codes (17.3) |
| Tue, July 22 | 3:05p | Gates B03 | Problem set 4 due | |
| Tue, July 22 | 6:00p-7:00p | Skilling 191 | Live E1 | Midterm review session |
| Wed, July 23 | 3:30p-4:30p | Gates 381 | Office hours: Toli | |
| Thu, July 24 | 1:15p-3:05p | Gates B03 | Midterm examination | |
| Mon, July 28 | 11:00a-12:15p | Gates B03 | Live E3 | Problem session |
| Mon, July 28 | 12:30p-2:30p | Gates 193A | Office hours: Aristides | |
| Tue, July 29 | Noon-1:00p | Gates 381 | Office hours: Toli | |
| Tue, July 29 | 1:15p-3:05p | Gates B03 | Live E4 | Lecture: the set-covering problem (37.3; skip analysis), amortized analysis (18.1-18.3), dynamic tables (18.4), splay tree analysis (handout 25) |
| Tue, July 29 | 3:05p | Gates B03 | Problem set 5 due | |
| Thu, July 31 | 1:15p-3:05p | Gates B03 | Live E4 | Lecture: disjoint-set data structures (22.1-22.3), project overview |
| Thu, July 31 | 3:30p-4:30p | Gates 381 | Office hours: Toli | |
| Mon, August 4 | 11:00a-12:15p | Gates B03 | Live E3 | Problem session |
| Mon, August 4 | 12:30p-2:30p | Gates 193A | Office hours: Aristides | |
| Tue, August 5 | Noon-1:00p | Gates 381 | Office hours: Toli | |
| Tue, August 5 | 1:15p-3:05p | Gates B03 | Live E4 | Lecture: graph algorithms [guest lecture by Aristides Gionis] |
| Tue, August 5 | 3:05p | Gates B03 | Problem set 6 due | |
| Fri, August 8 | 1:15p-3:05p | Skilling 193 | Live E2 | Lecture: Monte Carlo algorithms [guest lecture by Rajeev Motwani] |
| Mon, August 11 | 12:30p-2:30p | Gates 193A | Office hours: Aristides | |
| Tue, August 12 | Noon-1:00p | Gates 381 | Office hours: Toli | |
| Tue, August 12 | 1:15p-3:05p | Gates B03 | Live E4 | Lecture: computational geometry and kinetic data structures [guest lecture by Julien Basch] |
| Thu, August 14 | 1:15p-3:05p | Gates B03 | Live E4 | Lecture: program visualization [guest lecture by Yung-Hsiang Lu], genetic algorithms [guest lecture by John Koza] |
| Thu, August 14 | 3:30p-4:30p | Gates 381 | Office hours: Toli | |
| Fri, August 15 | 5:00p | On-line | Project due; no extensions | |
| Fri, August 15 | 5:00p | Gates 110 | Problem sets due; no extensions | |
| Wed, August 27 | Noon | On-line | Class grades announced |