| Week | of | Lecture | Readings | Section |
|
January |
14 | Introduction | DD 1-2 | no lab |
|
21 | Objects, flow of control, iteration | DD 2
| unix, compilation |
|
28 | Functions, recursion | DD 3 | functions |
| Feb |
4 | Classes and methods | DD 6-7 |
recursion |
|
|
11 | Vectors, arrays, streams | DD 4, 12 | classes |
|
18 |
Streams, file processing.
| DD 12, 14 | debugging |
|
25 |
Running time analysis,
midterm Thursday
| CP 9 | |
| Mar |
4 |
Sorting (cont.). Pointers, dynamic memory. | CP 3-4 | O-Notation, writing makefiles |
|
[Sorting Algorithms Demo]
|
|
11 | Spring Break
| | |
|
|
|
18 | Linked lists.
| CP 4 | pointers |
| |
25 | Linked lists and template classes. | CP 4, (DD 11)
| pointers and lists |
|
Apr
|
1 | Stacks, queues | CP 6-7 | queues, templates |
|
|
8 | Trees | CP 10
| inheritance |
|
15 | Searching, Hashing |
CP 11-12
| templates review |
|
| 22 | Graphs | CP 13 | hash tables |
|
| 29 | Review | | |
|
| |