[Bowdoin Computer Science]

Csci 231: The Design and Analysis of Algorithms

Fall 2008: Tue, Thu 2:30 - 3:55 in Searles 126

Syllabus | Links | Students

This course is an introduction to the design and analysis of algorithms, building on the concepts from Data Structures (csci 210).

It is a theoretical class, and involves no programming.

Prerequisites: Csci 210 and (Csci 189 or Math 200 or permission of instructor)

Instructor: Laura Toma
Office: 219 Searles Hall
Email: ltoma at bowdoin

Office hours: Tue, Wed, Thu 4-5pm (after class).

In addition to the official office hours, you can drop by for a quick question any time I am in the office. Or, just send me an email to setup a (different) time.

I often work late evenings and I may be in the office the evening before homework is due, but do not take it for granted and do not rely on it. When I work late, you are very welcome to drop by and ask questions or chat.

Class webpage: http://www.bowdoin.edu/~ltoma/teaching/cs231/fall08/. Note that this is a link from my personal website at Bowdoin. This site will contain all class-related material along the semester. The class does not have a Blackboard site.

Main Topics:


Other good reference books include:

Grading policy

I find that 'class participation' has become too much of a cliche, so I am not including it in the list above. Have you seen a class where participation is not encouraged, and does not count? This class is not an exception.


Homework assignments will be made available online as the semester progresses. They will usualy be due one week after they are assigned, and solutions will be handed out the day the homework is due. Because of this no credit is given for homework received late. For special situations contact me in advance.

Homework policy: