| Date | Description |
|---|---|
| January 4 |
Intro; ADTs; Stacks & Queues Weiss Chapter 3 |
| January 6 |
Math Review; Algorithm Analysis Weiss Chapter 2 |
| January 9 |
Asymptotic Analysis Weiss Chapter 2 |
| January 11 |
Priority Queue; Binary Heap Weiss Chapter 6 to 6.5 |
| January 13 |
Binary Heap Weiss Chapter 6 to 6.5 |
| January 23 |
Dictionary; Binary Search Tree; AVL Tree Weiss Chapter 4 to 4.4 |
| January 25 |
B Trees Weiss Chapter 4.7 |
| January 27 |
Hashing Weiss Chapter 5 to 5.5 |
| January 30 |
Hashing Weiss Chapter 5 to 5.5 |
| February 1 |
Comparison Sorting Weiss Chapter 7, excluding 7.4, 7.10, 7.12 |
| February 3 |
Beyond Comparison Sorting Weiss Chapter 7, excluding 7.4, 7.10, 7.12 |
| February 6 |
Graphs Weiss Chapter 9 to 9.1 |
| February 10 |
Graph Traversals; Topological Sort Weiss Chapter 9.2 |
| February 13 |
Shortest Paths Weiss Chapter 9.3 |
| February 15 |
MultiThreading; Fork-Join Parallelism SPAC Notes Section 1 to 3 |
| February 17 |
MultiThreading; Fork-Join Parallelism SPAC Notes Section 1 to 3 |
| February 22 |
Parallel Analysis and Parallel Prefix SPAC Notes Section 4 and 5 |
| February 24 |
Parallel Sorting and Shared-Memory Concurrency SPAC Notes Section 4 and 5 |
| February 27 |
Mutual Exclusion and Locking SPAC Notes Section 6 and 9 |
| February 29 |
Mutual Exclusion and Locking SPAC Notes Section 6 to 9 |
| March 2 |
Readers/Writer Locking SPAC Notes Section 10 |
| March 5 |
Disjoint Sets and Minimum Spanning Tree Weiss Chapter 8 to 8.5 and 9.5 |
| March 7 | Wrapping Up |