CS 580 --- Design and Analysis of Algorithms --- Fall 2005

Professor:

Greg N. Frederickson
Office: CS 224
Office hours: TBA, and by appointment
email: gnf at cs.purdue.edu
The course URL is on webct vista: http://www.itap.purdue.edu/tlt/ecourses/index.cfm

Assistants:

Yong Wook Choi, Pankaj Kumar

Text:

T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein,
Introduction to Algorithms, second edition, McGraw-Hill (2001).

Partial List of Topics:

Recurrence Relations
Prune and Search
Divide and Conquer
Dynamic Programming
Data Structures
Graph Algorithms
Lower Bound Techniques
NP-complete Problems
Parallel Algorithms

Course Work:

	Approx. weight in grade
Written assignments (7-10)	30%
Midterm exam (evening, 7:00-9:00pm, Oct. 18)	35%
Final Exam (during exam period)	35%

Prerequisites:

CS 381, CS 483

Assignments:

Will be posted on WebCT Vista.

Last updated August 23, 2005.