CS 381 - - - Spring 2010

Introduction to the Analysis of Algorithms

Professor:

G. N. Frederickson
Office: LWSN 2116E
Office hours: M, T, Th 1:00-2:00pm
email: gnf at cs.purdue.edu
We will use Blackboard Vista: http://www.itap.purdue.edu/tlt/blackboard/index.cfm
time and location: MWF 9:30-10:20am, HAAS G066

Text:

T. H. Cormen, C. E. Leiserson, R. L. Rivest, C. Stein,
Introduction to Algorithms, third edition, MIT Press, 2009.

List of Topics:

(Mathematical) Foundations
Divide and Conquer Algorithms
Greedy Algorithms
Graph Algorithms
Data Structures
Dynamic Programming
Geometric Algorithms
Algebraic and Numeric Algorithms
Reductions
NP-complete Problems

Course Work:

Approx. weight in grade
Written and programming
assignments (8-10)
30%
Midterm exam (early March,
- evening exam)
35%
Final Exam 35%



Last updated January 7, 2010.