The course meets MWF 8:30am in Dunn 406.
Instructor: Dr. R. Rosebrugh, Dunn 203
Prerequsite: CS 2611 and CS/MATH 2211
Text: Introduction to Algorithms by Cormen, Leiserson, Rivest, Stein, 2001 (2nd ed).
Syllabus: We will cover Chapters 1-4, 7, 8 and parts of 15, 16, 22-25 and 32-34.
Grades: will be assigned with approximately the following weights:
At least 10 quizzes based on assigned homework will be held in class.
You are required to submit at least 7 quizzes to pass the course.
The midterm test will be held on October 20, 2004.
For other official detail see the Math/CS Department Web pages.
Check this URL regularly for information about the course.
From the text: 1.2-3, B.2-5, B.4-4.
Due September 20.
From the text: 2.1-3, 2.3-3, 3.1-1, 3.1-4, 3.2-2.
Due September 29.
From the text:
4.1-2, 4.2-3, 4-1 (b), (d), 4-4 (a), (h), 6.1-3, 6.2-6, 6.4-3.
Due October 13
From the text: 7.2-5, 8.3-2, 15.1-5, 15.2-1, 15.2-4
October 25.
From the text: 16.1-4, 16.2-4, 16.2-7, 22.1-7, 22.2-6
Due November 10.
From the text: 22.3-7, 22.4-3, 23.1-3, 23.1-6, 24.3-3, 24.3-3, 34.1-3, 34.2-2
Due December 3.
Last updated: 2004-09-20.