University of Chicago CSPP 570 - General Information
CSPP 570: Algorithms
Autumn 2001
General Information
Goal
This course is an introduction to the design and analysis of
algorithms. Topics include asymptotic notation, basic algorithm
design techniques such as recursion, dynamic programming, and greedy
algorithms; sorting and searching; and graph algorithms such as graph
search, minimal spanning trees, and shortest paths.
Prerequisites
Coursework in discrete mathematics is recommended. There are no
programming prerequisites.
Textbook
The required text is
Introduction to Algorithms
(First Edition)
by T. H. Cormen, C. E. Leiserson, and R. L. Rivest.
brady@cs.uchicago.edu