CS 381 - - - Spring 2012

Introduction to the Analysis of Algorithms

Professor:

G. N. Frederickson
Office: LWSN 2116E
Office hours: Tu 1:00-2:00pm, Th 1:00-2:00pm, F 1:00-2:00pm
email: gnf@cs.purdue.edu
We will use Blackboard Vista: https://blackboard.purdue.edu/webct/logon/8056011
time and location: MWF 4:30-5:20am, LWSN B155

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)	25%
Pop quizzes (including attendance quizzes)	15%
Midterm exam (early March, evening exam)	30%
Final Exam	30%

Last updated December 9, 2011.