The primary focus of this course is data structures: objects that can store data and/or contain other objects. A tentative syllabus for the semester is as follows...
| Week | Readings (Chapters) |
Lecture Topic | Lab | Project |
|---|---|---|---|---|
| Part I | ||||
| 1 | 1 | Getting Started | 0 | 0 |
| 2 | 2 | Classes, Inheritance & Polymorphism | 1 | 1 |
| 3 | 3 | Pointers | 2 | 2 |
| 4 | 4 | Pointers in Classes | 3 | 3 |
| 5 | 5 | Generic Containers (Templates) | 4 | 4 |
| 6 | 6 | Lists | 5 | 5 |
| 7 | 10.4 | Algorithm Analysis and "Big Oh" Notation | 6 | 6 |
| 8 | 7 | Stacks and Exceptions | 7 | 7 |
| Part II | ||||
| 9 | 8 | Queues | 8 | 8 |
| 10 | 12 | Binary Search Trees | 9 | 9 |
| 11 | 15 | Processing Data Structures in Parallel Using OpenMP | 10 | 10 |
| 12 | 15 | The STL set and map containers | 11 | |
The two exams will cover Parts I and II, respectively, with the second test being cumulative.