Also, since you will find out anyway: Yes, we do make fun of you in class when you miss lecture.
| Date | Topic |
|---|---|
| Tu 1/27 | Introduction |
| Th 1/29 | Review |
| Tu 2/3 | Recursion |
| Th 2/5 | Recursion |
| Tu 2/10 | Merge Sort |
| Th 2/12 | Quicksort |
| Tu 2/17 | Binary Search |
| Th 2/19 | More Recursion |
| Tu 2/24 | A Recursive Descent Parser |
| Th 2/26 | Exam 1 |
| Tu 3/3 | Pointers |
| Th 3/5 | Pointers |
| Tu 3/10 | Pointers |
| Th 3/12 | Lists |
| Tu 3/17 | Lists |
| Th 3/19 | TBA |
| Tu 3/24 | Spring Break |
| Th 3/26 | Spring Break |
| Tu 3/31 | Exam 2 |
| Th 4/2 | Object-Oriented Programing |
| Tu 4/7 | Lists in C++ |
| Th 4/9 | Class Derivation & Inheritance |
| Tu 4/14 | More on Inheritance; Stacks |
| Th 4/16 | Queues; Trees & Tree Traversal |
| Tu 4/21 | Expression Trees |
| Th 4/23 | Project 5; Danger of Destructors |
| Tu 4/28 | Binary Search Trees |
| Th 4/30 | More Binary Search Trees |
| Tu 5/5 | Hash Tables |
| Th 5/7 | Function Pointers & and Function Parameters |
| Tu 5/12 | C++ Summary |
| Th 5/21 | Final Exam, 10:30am - 12:30pm, LH5 |