| Week | Dates | Topics | Reading* |
|---|---|---|---|
| 1 | M. 9/26 | Course introduction | |
| W. 9/28 | Abstract data types Sets and sequences Complexity and testing Dynamic arrays |
Chapters 1-4 | |
| 2 | M. 10/3 | ||
| W. 10/5 | |||
| 3 | M. 10/10 | ||
| W. 10/12 | |||
| 4 | M. 10/17 | ||
| W. 10/19 | Exam 1 | ||
| 5 | M. 10/24 | Linked structures
Templates and iterators Stacks and queues Recursion (start) |
Chapters 5-9 |
| W. 10/26 | |||
| 6 | M. 10/31 | ||
| W. 11/2 | |||
| 7 | M. 11/7 | ||
| W. 11/9 | Exam 2 | ||
| 8 | M. 11/14 | Recursion (finish) Binary trees Searching intro |
Chapters 10-12 |
| W. 11/16 | |||
| 9 | M. 11/21 | ||
| W. 11/23 | |||
| 10 | M. 11/28 | ||
| W. 11/30 | Exam 3 | ||
|
*Textbook: | |||