CSC 284/484: Advanced Algorithms

Spring 2008 Information

Advanced study of design and analysis of algorithms. Topics typically include: growth of functions; recurrences; probabilistic analysis and randomized algorithms; maximum flow; sorting networks; expander graphs; matrix operations; linear programming; discrete Fourier transform; number-theoretic algorithms; string matching; computational geometry; NP-completeness; approximation algorithms. Students taking this course at the 400 level may be required to complete additional tests, readings or assignments.

Prerequisite: CSC 282. (Spring)


Last updated 1/17/2008 by Marty Guenther (marty@cs.rochester.edu)