Primary Text:
|
|
|
|
| 1 | Inheritance, Polymorphism |
2.2
|
| 2 | Templates, Exceptions |
2.4, 2.5
|
| 3 | Algorithm Analysis, Asymptotic Notation |
3.1, 3.4, 3.5
|
| 4 | Stacks, Queues |
4.2, 4.3
|
| 5 | Linked Lists, Recursion |
4.4, 4.1
|
| 6 | Deques, Priority Queues |
4.5, 7.1, 7.2
|
| 7 | Vectors |
5.1
|
| 8 | Lists |
5.2
|
| 9 | Midterm exam, Trees |
6
|
| 10 | Trees, Binary Trees |
6
|
| 11 | Binary Trees, Binary Search Trees |
6, 9.1
|
| 12 | Graphs |
12
|
| 13 | Graphs, Graph algorithms |
12
|
| 14 | Linear Search, Binary Search |
8.3
|
| 15 | Sorting |
5.4, 10
|
| W 5/6 4–6 PM | Final Exam |
|