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

Professor:

Greg N. Frederickson

Office: LWSN 2116E
Office hours: Tuesday, Thursday 1:00-2:00pm, and by appointment
email: gnf@cs.purdue.edu
The course URL is on webct vista: http://www.itap.purdue.edu/tlt/ecourses/index.cfm

Assistant:

Yongwook Choi

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, date and time TBA)	35%
Final Exam (during exam period)	35%

Prerequisites:

CS 381 and CS 483, or equivalent

Assignments:

Will be posted on WebCT Vista.

Last updated January 11, 2007.