Department of Computer Science
CS 210 - Data Structures

Winter 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 C++ will provide an opportunity to study the characteristics of these data structures directly.
TEXTS (required):
Sartaj Sahni, Data Structures, Algorithms, and Applications in C++, McGraw-Hill, 1998, and on-line handouts
INSTRUCTOR:
Eric Chown, 207 Adams Hall
Email address: echown@polar.bowdoin.edu
Web address: http://www.bowdoin.edu/~echown
Office Hours: M,T,W 3:30-5:00, or by arrangement
MEETING TIMES:
Class meeting: MW 12:00-1:30 - Adams 301
Lab meeting: T 2:00-3:30 - Adams 208
COURSE OUTLINE:
Week of Topics Readings Work Due
Jan 25 Transition to C++: pointers, arrays, and structures Chapter 1, , C++ guide, Hand1,Hand2
Feb 1 Objects and classes Chapter 1, Handouts Lab 1
Feb 8 Templates: the Vector class, inheritance Chapter 1, Handouts Lab 2
Feb 15 Program Performance Chapter 2 Lab 3
Feb 22 Overview of data structures; linked lists Chapter 3.1-3.4 Lab 4
March 1 Indirect Addressing Chapter 3.5-3.7 Lab 5
March 8 **** Test 1 **** Lab 6
March 15 Arrays, and Matrices Chapter 4
April 5 Stacks, Queues Chapter 5, 6
April 12 Hashing Chapter 7 Lab 7
April 19 Trees Chapter 8 Lab 8
April 26 Trees (continued) Chapter 11 Lab 9
May3 *** test # 2 ***
May 10
(1/2 week) 		Review, cleanup

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.