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

Professor:

Greg N. Frederickson
Office: CS 224
Office hours: MW 1:00-2:00 pm, and by appointment
email: gnf@cs.purdue.edu
The course URL is on webct: https://webct.ics.purdue.edu/

Assistant:

Wei Jiang
Office: Math 413
Office hours: W 3:00-4:30, F 1:30-3:00 pm
email: wjiang@cs.purdue.edu

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 - March 4, 7:00-9:00 pm, LILY 3102)	35%
Final Exam (during exam period)	35%

Prerequisites:

CS 381, CS 483

Assignments:

will be posted here.

Last updated January 9, 2004.