Department of Computer Science
CS 210 - Data Structures

Fall 1999 Syllabus

COURSE OBJECTIVES:
Solving complex computational problems requires the use of appropriate data structures, such as stacks, priority queues, search trees, dictionaries, hash tables, and graphs. It also requires the ability to measure the efficiency, or "complexity" of operations like sorting and searching, in order to make effective choices among alternative solutions. This course is a study of data structures - their design, implementation, and effective use in solving computational problems. Laboratory exercises in Java will provide an opportunity to study the characteristics of these data structures directly.
TEXTS (required):
Bailey, Duane, Java Structures: Data Structures in Java for the Principled Programmer., McGraw-Hill, 1999, and on-line handouts
INSTRUCTOR:
Eric Chown, 219 Searles Science Building
Email address: echown@polar.bowdoin.edu
Web address: http://www.bowdoin.edu/~echown
Office Hours: T,TH 3:30-4:30, W 3:30-5:00 or by arrangement
MEETING TIMES:
Class meeting: TTH 1:00-2:30 - Searles 126
Lab meeting: W 2:00-3:30 - Searles Mac Lab
COURSE OUTLINE:
Week of Topics Readings Work Due
Aug 30 Transition to Java: Object oriented programming. Chapter 0, , Pascal to Java guide
Sep 6 Object Oriented Programming (cont.) Chapter 1
Sep 13 Java Basics Chapter 2 Lab 1
Sep 20 Vectors Chapter 3 Lab 2
Sep 27 Program Analysis Chapter 4 Lab 3
Oct 4 Sorting Chapter 5 Lab 4
Oct 11 Lists Chapter 6
Oct 18 **** Test 1 **** Lab 5
Oct 25 Stacks (half week) Chapter 7 Lab 6
Nov 2 Queues Chapter 7
Nov 9 Trees Chapter 10 Lab 7
Nov 16 Trees (continued) Chapter 12 Lab 8
Nov 23 Dictionaries (half week) Chapter 13
Nov 30 Lab Time
Dec 7 **** Test 2 **** Lab 8

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.