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: 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 March 16, 2014 .
Check this URL regularly for information about the course.
An in class oral presentation of 15-25 minutes and accompanying write-up is required. Topics will be selected from among those in Chapters 11-13 of the text and will be available in early February. Presentation dates will be after mid-March and write-ups due before the end of classes.