Syllabus | Links | Students
This course is an introduction to the design and analysis of algorithms, building on the concepts from Data Structures (csci 210).
The class is purely theoretical and involves no programming.
Prerequisites: Csci 210 and (Csci 189 or Math 200 or permission of the instructor). The goal of the Math prerequisite is to ensure that the students have achieved a certain mathematical maturity, and a dexterity with induction and proofs. When there are no good reasons to postpone Algorithms for another year, we let students take Algorithms and Math 200 at the same time. Occasionaly it is possible to substitute Math200 with a different 200-level math class.
Instructor: Laura Toma
Office: 219 Searles Hall
Email: ltoma at bowdoin
Office hours: Mon, Tue 3-4:30
If you cannot come during these times, send me an email to make another appointment. For quick questions you can drop by any time I am in the office.
Class webpage: http://www.bowdoin.edu/~ltoma/teaching/cs231/fall10/. 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.
Other good reference books include:
Homework assignments will be made available online as the semester progresses. They will usualy be due one week after they are assigned, and partial 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.
There will be a few times throughout the semester when I will need to skip a class because of conflicting engagements (conferences, committees, etc). I will inform you of the exact dates and we will schedule make-up classes ahead of time.
Academic Integrity You are expected to follow the academic honor code. Collaboration on homeworks is encouraged, however you are responsible to write the solutions on your own, and list the names of all your collaborators. Any violation will be severely punished.