Overview
Please print and bring the lecture notes to class each week. This is a tentative schedule.
| Week | Topic | Notes |
|---|---|---|
| 1 | Dictionaries, 2-3-4 Trees | PDF (1-13) |
| 2 | 2-3-4 Trees, Augmented Data Structures | PDF (14-31) |
| 3 | Introduction to Graph Theory | PDF (32-47) |
| 4 | Graph Search Algorithms | PDF (48-57) |
| 5 | Priority Queues and Prims Algorithm | PDF (58-66) |
| 6 | Heaps for implementing Priority Queues | PDF (67-78) |
| 7 | Disjoint Sets and Kruskal's Algorithm | PDF (79-88) |
| 8 | Disjoint Sets and Kruskal's Algorithm / Amortized Analysis | PDF (89-98) |
| 9 | Amortized Analysis | (99-111) |
| 10 | Average Case Analysis | PDF (112-128) |
| 11 | Direct Addressing (Hashing) | PDF (129-146) |
| 12 | Hashing -- Open Addressing, Dynamic Hashing | PDF (147-161) |
| 13 | Exam Review |