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

Professor:

Greg N. Frederickson

Office: LWSN 2116E
Office hours: MW 1:00-2:00pm, and by appointment

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, third edition, MIT Press (2009).

Partial List of Topics:

Recurrence Relations
Prune and Search, and Divide and Conquer
Dynamic Programming
Data Structures including Fibonacci heaps, disjoint sets, van Emde Boas trees
Graph Algorithms including max flow (Goldberg-Tarjan)
Lower Bound Techniques
NP-complete Problems including approximation algorithms
PSPACE-complete Problems
Randomized Algorithms

Course Work:

	Approx. weight in grade
Written assignments (7-10)	30%
Midterm exam (evening, after October break)	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 16, 2010.