Subscribe to this calendar (Google, iCal, etc.)
Date | Description |
---|---|
March 31 |
Intro, Stacks, Queues slides (pptx), pdf, handout, A-ink, B-ink |
April 2 | Algorithm Analysis 1 (definitions) |
April 4 | Algorithm Analysis 2 (more practice) |
April 7 | Priority Queues 1 (ADT, basics) |
April 9 | Priority Queues 2 (analysis, buildHeap) |
April 11 | Algorithm Analysis 3 (recursion!) |
April 14 | Dictionaries 1 (ADT and BSTs) |
April 16 | Dictionaries 2 (AVL trees) |
April 18 | Dictionaries 3 (Wrap AVL, hashing) |
April 21 | Dictionaries 4 (Hashing basics) |
April 23 | Dictionaries 5 (More Hashing) |
April 25 | Sorting 1 (Basics) |
April 28 | Sorting 2 (Efficient Sorts) |
April 30 | MIDTERM :O |
May 2 | Sorting 3 (non-comparison and lower-bound) |
May 5 | Graphs 1 (Data Structures, BFS) |
May 7 | Graphs 2 (BFS/DFS) |
May 9 | Graphs 3 (Dijkstra), Reductions |
May 12 | Reductions |
May 14 | Parallel 1 (Fork-Join) |
May 16 | Parallel 2 (Analysis, basics) |
May 19 | Parallel 3 (Prefix) |
May 21 | Synchronization 1 (Concurrency, mutex) |
May 23 | Synchronization 2 (Race Conditions) |
May 28 | Synchronizations 3 (wrap-up), start MSTs |
May 30 | Minimum Spanning Trees |
June 2 | P/NP I (definitions, reductions) |
June 4 | P/NP II (more examples, implications) |
June 6 | Victory Lap or something fun |