CSci 210: Data Structures
Tue 8:30 - 9:55, Wed 8:00-9:25, Thu 8:30-9:55 in Searles 126/128
Syllabus & Labs
Solving computational problems requires the use of appropriate data
structure and the ability to measure their efficiency, in order to make
effective choices among alternative solutions.
This course is a study of fundamental data structures, their design,
implementation, efficiency and effective use in solving problems.
Though the class is programming-intensive and a lot of the
assignments involve programming, programming is not the main focus of
the class. The class is rather about programming methodology. More
precisely, the class focuses on the following broad topics:
- Standard abstract data structures: The class will study the basic
data structures that come up in computational solutions to
problems. You will learn about lists, vectors, stacks, queues,
priority queues, trees and hash tables.
- Design: You will refine your learning of how to come up with
a solution to a problem. This involves thinking abstractly about
the problem, modeling with appropriate classes and methods, thinking
about modularity and data abstraction, dividing a task into building
blocks, identifying data structures.
- Analysis: You will learn to analyse the efficiency of your
solution. You will learn to use efficiency considerations to make
the right choice of data structures.
- Program development: Programming can be tedious and
brain-damaging if not approached in the right way. You will learn
about debugging and testing and incremental development.
- Programming style: Not all code that works is good. When
programming, you will learn to strive for simplicity, clarity and
csci 101; or, students with programming experience from highschool may
take the course with the permission of the instructor.
- Office: 219 Searles Building
- Website: http://www.bowdoin.edu/~ltoma
- Email: ltoma at bowdoin
- Office hours: T, Th 2-4pm. For quick questions
you can come to my office anytime.
- Yuna Oh (yoh at bowdoin )
Class Email: csci210 at bowdoin
Class webpage: http://www.bowdoin.edu/~ltoma/teaching/cs210/fall09/.
All material will be available from this page throughout the
semester. This class does not have a Blackboard site.
Other useful text:
||Sorting and searching.
||Analysis of algorithms.
||Object-oriented (OO) concepts.
||Stacks and Queues.
|Week 6, 7
|Week 7, 8
||Searching and backtracking. Breadth- and depth-first search.
||Trees and binary search trees.
||Balanced binary search trees.
||Maps and hash tables.
|Week 13, 14
Work for the course and grading policy:
The work for this course includes class participation, readings, two
tests, in-class assignments, homework assignments, and a number of lab
assignments. The bulk of your work will be in the labs. Lab
assignments will be available online.
Approximately 50% of your grade will be based on the exams. The rest
will be based on labs and homeworks.
Since the major goal of the class is to teach you about program
development, not handing in any lab is grounds for failing the course.
This does not assume, however, that all labs need to be completed
One of the goals of the class is to learn the difference between
programs that simply work, and quality programs. Therefore do not
assume that completing an assignment will result in an A program.
Lab work will be done individually or in teams of 2 people. The
lab-time is dedicated to getting started on the lab. Each lab
assignment will be due one week after it is assigned (unless otherwise
specified in class). The lab assignment must be turned in
electronically (by email), as well as hard-copy. Endorse each
assignment with your signature to acknowledge that you have followed
the honor code for the class.
The assignments must be turned in at the specified time. The reason is
that it is absolutely essential that you do not fall behind in the
Furthermore, once an assignment is due, I will no longer provide help
In addition, you may not work on late assignments during class
The late penalty for an assignment is 25% per day.
Failure to hand in an assignment is grounds for failing the course. So
you are better off handing in something incomplete than not handing in
Honor code and cheating policy
Students are expected to follow the Bowdoin Computer Use Policy and
the Academic Honor Code. You are encouraged to discuss ideas and
techniques broadly with other class members, but not specifics
of assigned problems except as part of group projects. Discussions
should be limited to questions that can be asked and answered without
using any written medium (e.g. pencil and paper or email).
This means that at no time should a student read any code
written by another student unless they are part of the same group.
Sharing of code or intermediate designs is expressly prohibited. The
same rules apply once you have finished the course - sharing your
code with other students will be considered a violation of Bowdoin's
honor code. Violation of this policy is grounds for me to initiate
an action that would be filed with the Dean's office and would come
before the J Board. If you have any questions about this policy,
PLEASE do not hesitate to contact me. This will be a zero-tolerance
It is permissible to use software and materials available from
other sources (understanding that you get no credit for using the work
of others on those parts of your projects) as long as: 1) You
acknowledge explicitly which aspects of your assignment were taken
from other sources and what those sources are. 2) The materials are
freely and legally available. 3) The material was not created by a
student at Bowdoin as part of this course this year or in prior years.
All write-ups, reviews, documentation, and other written material
must be original and may not be derived from other sources.
If in the future you will provide your work to students in 210 this
will also constitute a violation of Bowdoin's honor code.