Fall 1998 Syllabus
Week of | Topics | Readings | Work Due |
Sep 7 | Transition to C++: pointers, arrays, and structures | Chapter 1, , C++ guide, Hand1,Hand2 | |
Sep 14 | Objects and classes | Chapter 1, Handouts | Lab 1 |
Sep 21 | Templates: the Vector class, inheritance | Chapter 1, Handouts | Lab 2 |
Sep 28 | Program Performance | Chapter 2 | Lab 3 |
Oct 5 | Overview of data structures; linked lists | Chapter 3.1-3.4 | Lab 4 |
Oct 12 | Indirect Addressing | Chapter 3.5-3.7 | Lab 5 |
Oct 19 | *** test 1 *** Sample 1, Sample 2 | Lab 6 | |
Oct 26 | Arrays, and Matrices | Chapter 4 | Lab 6 |
Nov 2 | Stacks, Queues | Chapter 5, 6 | Lab 7 |
Nov 9 | Hashing | Chapter 7 | |
Nov 16 | Trees | Chapter 8 | |
Nov 23 | Trees (continued) | Chapter 11 | Lab 8 |
Nov 25-29 | *** Thanksgiving Vacation *** | ||
December 1 | *** test # 2 *** | ||
Dec 7 (1/2 week) |
Review, cleanup | Lab 9 | |
WORK FOR THE COURSE: The work for this course includes class participation, readings, two tests, 10 weekly lab assignments, and a final project. Lab assignments can be downloaded directly from this Web page on the Monday of the week when it is assigned. All work will be graded and will contribute to your course grade. Attendance is required for all scheduled classes and lab meetings.
Lab work may be done either individually or in teams of two (your choice), but written lab exercises should be completed individually. Each lab assignment should be turned in on the Monday following the week it is assigned. Students are expected to follow Bowdoin's Computer Use Policy and its Academic Honor Code.
The final project will provide an opportunity to design and implement a complex piece of software for a real-world problem, using the data structures and concepts that you have learned throughout the course.