| Date | Description |
|---|---|
| April 2 |
S1: Intro; P1 Handout, Solutions |
| April 9 |
S2: Heaps; Algorithm Analysis Handout, Solutions |
| April 16 |
S3: More Algorithm Analysis Handout, Solutions |
| April 23 |
S4: AVL Trees; B-Trees Handout, Solutions |
| April 30 |
S5: B-Trees (cont.): Electric Boogaloo; Hashing Handout, Handout |
| May 7 |
S6: Writing Parallel Programs Handout, Starter Code, Solutions, Bad Writeups, Bad Writeups Explained |
| May 14 |
S7: Parallel Prefix; Recurrences Handout, Solutions for Parallel Prefix Thingies and Minimax |
| May 21 |
S8: Parallel Quicksort; Concurrency Handout, Solutions |
| May 28 |
S9: Graphs; Shortest Paths Handout, Solutions |
| June 4 |
S10: Graphs 2049: MSTs and Beyond Use Section 9 materials |