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

Professor:

Greg N. Frederickson

Office: LWSN 2116E
Office hours: MW 1:00-2:00pm, and by appointment
Note: Office hours are cancelled on Oct. 13, Oct. 29 and Nov. 26.
email: gnf at cs.purdue.edu
The course URL will be on blackboard vista: http://www.itap.purdue.edu/tlt/blackboard/

Assistants:

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 (Thursday, Oct. 16, 8:00-10:00pm, room TBA)	35%
Final Exam (during exam period)	35%

Prerequisites:

CS 381 and CS 483, or equivalent

Assignments:

Will be posted on Blackboard Vista.

Last updated August 29, 2008.