COURSE DESCRIPTION
An advanced in-depth study of the design and analysis of algorithms. Topics include computational geometry, parallel algorithms, dynamic programming, probabilistic analysis, greedy algorithms, NP-Completeness and approximation.
Prerequisites: CS 350 or equivalent
Text Book:
Introduction to Algorithms (3rd edition)
Cormen, Leiserson, Rivest and Stein
