Fall 2000 Syllabus
Week of | Topics | Readings | Work Due | |
Sep 4 | Advanced Java: Object oriented programming. | |||
Sep 11 | Object Oriented Programming (cont.) | Chapter 1 | Lab 1 | |
Sep 18 | Vectors, Recursion | Chapters 2, 3 | Lab 2 | |
Sep 25 | Program Performance | Chapter 2 | Lab 3 | |
Oct 2 | Data Structures: Lists | Chapter 4 | Lab 4 | |
Oct 9 | Sorting | Misc. | Lab 5 | |
Oct 16 | Arrays and Matrices | Chapter 6 | Lab 6 | |
Oct 23 | **** Test 1 **** | Lab 7 | ||
Oct 30 (half week) | Stacks and Queues | Chapter 9, 10 | ||
Nov 6 | Hashing | Chapter 11 | Lab 8 | |
Nov 13 | Trees | Chapter 12 | Lab 9 | |
Nov 20 (half week) | Advanced Trees (continued) | Chapter 16 | ||
Nov 27 | Cleanup, review | |||
Dec 4 | **** Test 2 **** | Lab 10 | ||
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 will normally be done individually or, in some cases, in teams of two (your choice), but written lab exercises should be completed individually. Each lab assignment should be turned in on the Tuesday following the week it is assigned no later than the start of Tuesday's class. 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.