Overview
Please print and bring the lecture notes to class each week. This is a tentative schedule.
| Week | Topic | Notes | Reading |
|---|---|---|---|
| 1 | Dictionaries, 2-3-4 Trees | Dictionaries and 2-3-4 Trees | CLRS Ch. 12 and 13 or Tamassia Ch. 1, 2.3, 2.5, 3.1-3.3 |
| 2 | 2-3-4 Trees, Intro to Augmented Structures |
Red-Black Trees and Augmented Structures |
Skim CLRS Ch. 14 for augmented data structures |
| 3 | Augmented Data Structures, Intro to Graph Theory |
Graphs | Tamassia 6.1-6.2 or CLRS 22.1 |
| 4 | Graph Search Algorithms | Graph Traversals | Tamassia 6.3-6.4 or CLRS 22.2-22.4 |
| 5 | Priority Queues and Prims Algorithm | Prim's Algorithm | Tamassia 2.4 (skim), 7.3 or CLRS 23 (skim 23.2) |
| 6 | Heaps for implementing Priority Queues | Heaps and Priority Queues | Tamassia 2.4 or CLRS 19 |
| 7 | Disjoint Sets and Kruskal's Algorithm | Disjoint Sets | Tammasia 4.2 or CLRS 21.1, 23.2 |
| 8 | Amortized Analysis | Amortized Analysis | Tammasia 1.5 or CLRS 17 |
| 9 | Average Case Analysis | Average Case Analysis | Tammasia 4.3 or CLRS 2.2, 7.3-7.4 |
| 10 | Average Case (continued) Intro to Hashing |
Direct Hashing | Tammasia 2.5 or CLRS 11.1-11.3 |
| 11 | Hashing -- Direct and Open Addressing | Open Hashing | CLRS 11.4 |
| 12 | Extensible and Incremental Hashing | Extensible Hashing | See A4 Handout |
| 13 | Clean-up and Exam Review | Exam Topics Topics Covered |
None |