Computer Science 3611: Algorithm Analysis
Fall 2007

General Information

The course meets MWF 8:30am.

Instructor: Dr. R. Rosebrugh, Dunn 203

Prerequsite: CS 2611 and CS/MATH 2211

Text: Algorithm Design by Kleinberg and Tardos, 2006 in Dunn 104.

Syllabus: We will cover Chapters 1-8 (excluding 4.3, 4.7-9, 5.5-6, 6.5, 6.10, 7.4, 7.6, 7.11-13) and a few sections in each of the later chapters (to be specified in class).

Grades: will be assigned with approximately the following weights:

The midterm test will be held on October 26, 2007.

For other official detail see the Math/CS Department Web pages.

Check this URL regularly for information about the course.



The regular written assignments are an essential part of the course; they will be listed here as assigned.

Last updated: 2007-08-27.