CS 581 Course Syllabus
Overview
This course studies both the fundamentals and the research boundaries of
algorithm design and analysis.
Asymptotics, relative efficiencies and implementation considerations are
all prime concerns.
Topics are diverse, and include graph algorithms, advanced data structures,
dynamic programming, complexity hierarchies, parallel computing and
approximation schemes.
Administrivia
CS 581 provides three hours graduate credit.
The prerequisite is CS 302 or its equivalent.
Grading
35% Exam I, to be held on March 8, 2007
35% Exam II, to be held on May 8, 2007
20% Project
10% Homework