This is the nominal topics list for the course. Please consult the section web pages for specific dates.
The links to the previous course slides are provided for your references. These might not be the slides used by your instructor. Some instructors do not use slides. Consult the section web pages for specifics.
| Lec # | Topic | Previous Course Slides |
|---|---|---|
| 1 | Introduction | Notes |
| 2 | Makefiles | Notes |
| 3 | Dynamic Memory and Pointers | Notes |
| 4 | Templates |
Notes Part 1 Notes Part 2 |
| 5 and 6 | Asympototic Analysis |
Math Review Notes Asympototic Notes |
| 7 | Lists | Notes |
| 8 | Stacks/Queues | Notes |
| 9 | Introduction to Trees | Notes |
| 10 and 11 | Binary Search Trees | Notes |
| 12 | Exam 1 | |
| 13 and 14 | Splay Trees | Notes |
| 15 | Exam 1 Review | |
| 16 and 17 | Heaps | Notes |
| 18 and 19 | B-Trees | Notes |
| 20 and 21 | Hashing | Notes |
| 22 | Exam 2 | |
| 23 | Disjoint Sets | Notes |
| 24 | Exam 2 Review | |
| 25 - 30 | Graphs | Notes |
| 31 | TBA |