The following matrix contains the expected progression of the course during the Fall 2002 term. Note: Visit Larry Nyhoff's site for supporting files.
Note: Lab(s) means all the exercises and Projects in that section of the Laboratory Manual. Lab Ex # means just the exercise.
| Week# | Date(M) | Readings for Week | Lab Assignments |
| 1 | 8/26 | Ch 1 Introduction Simple Data Types | Lab Exercises 1A,1B and Project 1 |
| 2 | 9/2 | Ch 2 Arrays, Structures, and Procedural Programming | Lab(s) 2 |
| 3 | 9/9 | Ch 3 Classes | Lab(s) 3 |
| 4 | 9/16 | BASIC C++ Week 1 | |
| 5 | 9/23 | BASIC C++ Week 2 | |
| 6 | 9/30 | Ch 6 Containers/Templates
|
Do Exercises
3.3 problems 1. compare, 2. concatenate, and 3. copy operations.
Lab(s) 5 |
| 7 | 10/7 | MIDTERM EXAM THIS WEEK | |
| 8 | 10/14 | Ch 6 Templates (Continued) | Finish Lab(s) 5 |
| 9 | 10/21 | Ch 8 Lists (10/18 Last Day To Withdraw) Big 'O' Notation from Ch 7 | Lab(s) 6B,7 |
| 10 | 10/28 | Ch 8 and 9 Linked Lists and More Linked Lists | Lab Exercise 8 |
| 11 | 11/4 | Force Field Analysis | Project 8 (cancelled) |
| 12 | 11/11 | Ch 11 Sorting | Lab Ex 10 (start) |
| 13 | 11/18 | Ch 11 More Sorting | Lab Ex 10 (complete) |
| 14 | 11/25 | Ch 10 Binary Trees (lecture) | |
| 15 | 12/2 | Final Examination Handed Out on Last Day of Class 12/4 and After Action Meeting | All Assignments Due |