• Introduction to Algorithms by Cormen, Lieserson, Rivest and Stein

The list of algorithms textbooks (good and bad) grows every year. A short list of some with merit might include:

• Fundamentals of Algorithmics by Brassard and Bratley

• Algorithm Design by Kleinberg and Tardos

• Analysis of Algorithms by Sedgewick and Flajolet

• Computer Algorithms by Baase and van Gelder

Requirements

There will be six small written assignments, approximately every two weeks. The best five assignment grades will contribute ten per cent to your final grade for a total of fifty per cent. There will be two in-class tests worth twenty-five per cent each.

Students with Disabilities

It is the policy of Wesleyan University to provide reasonable accommodations to students with documented disabilities. Students, however, are responsible for registering with Disabilities Services, in addition to making requests known to me in a timely manner. If you require accommodations in this class, please make an appointment with me as soon as possible, so that appropriate arrangements can be made. The procedures for registering with Disabilities Services can be found at http://www.wesleyan.edu/deans/disability-students.html.

Syllabus

The following is the plan for the course and is subject to change.

Report problems to dkrizanc at wesleyan.edu