[Bowdoin Computer Science]

Csci 231: Introduction to Algorithms

Fall 2011: M, W 11:30 - 12:55 in Searles 126

Syllabus


This course is an introduction to the design and analysis of algorithms.

The class is purely theoretical and involves no programming.

Prerequisites: a good mathematical background and good QR skills. Csci 210 and Math 200 are a plus.

Instructor: Laura Toma
Office: 219 Searles Hall
Email: ltoma at bowdoin
Office hours: Mon, Tue 3-4:30 For quick questions you can drop by any time I am in the office.

If you cannot come during office hours, send me an email to make another appointment.

TA: none this semester

Class webpage: http://www.bowdoin.edu/~ltoma/teaching/cs231/fall11/. 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:

Textbook:

Grading policy

Homework

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.

Homework policy:

Make-up classes

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.