Computer Science 3611: Algorithm Analysis
Winter 2014

General Information

Revisions are in bold italic

The course meets MWF 10:30am iin Dunn 406.

Instructor: Dr. R. Rosebrugh, Dunn 203

Prerequsite: CS 2631 and CS/MATH 2211

Text: Algorithm Design by Kleinberg and Tardos, 2006

Syllabus - Revised 28 Feb: 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 some sections in Chapters 9-10 (to be specified in class).

Grades - Revised 28 Feb: will be assigned with approximately the following weights:

The midterm test will be held on March 14, 2014 .

Paper

The paper is optional and replaces the in-class presentation. Topics will be selected by March 7 from among those in Chapters 11-13 of the text in consultation with the instructor. For those choosing not to write a paper, the rest of the marks will be adjusted in proportion.

Check this URL regularly for information about the course.

Links

Assignments

The regular written assignments are an essential part of the course.