Syllabus | Newsgroup | Links | People | Grade stats
This course is an introductory undergraduate course on the design and analysis of algorithms building on the concepts from CS210 (Data Structures). It introduces a number of basic algorithms for a variety of problems such as searching, sorting, selection and graph problems. It discusses analysis techniques, such as recurrences and amortization, as well as algorithm design paradigms such as divide-and-conquer, dynamic programming, and greedy algorithms.
Prerequisites: CS210 and either Math189 or CS200 (or permission of the instructor)
Instructor: Laura Toma
Office: 219 Searles Hall
Office hours: M,T,W,Th 4-5pm and the evening before homework is due. Also, any time I am in the office (and in a good mood). Or, just send me an email to setup a (different) time.
Class Email: firstname.lastname@example.org
Class webpage: http://www.bowdoin.edu/~ltoma/teaching/cs231/fall03/
Bowdoin class webpage: http://academic.bowdoin.edu/courses/f03/csci231/
Other good reference books include:
Homework assignments will be
made available online as the semester progresses. Since solutions are
handed out the day the homework is due, no credit is given for
homework problem solutions received late. For special situations
contact Laura (in advance).