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

Professor:

Greg N. Frederickson

Office: LWSN 2116E
Office hours: TBA, and by appointment
email: gnf at cs.purdue.edu
The course URL will be on webct vista: http://www.itap.purdue.edu/tlt/ecourses/index.cfm

Assistant:

TBA

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 (Tues., Oct. 16, 7:00-9:00pm in LILY 3418)	35%
Final Exam (during exam period)	35%

Prerequisites:

CS 381 and CS 483, or equivalent

Assignments:

Will be posted on WebCT Vista.

Last updated August 9, 2007.