CSCI 728 - Design and Analysis of Algorithms

3 Credits
This course will study the design and analysis of algorithms, their correctness, their limitations and their relationship to other algorithms. Students will learn how to analyze a problem and determine its reducibility to a common problem with a current solution. Topics covered may also include Computational Geometry, NP-Completeness, Approximation Algorithms, Dynamic Programming, Greedy Algorithms and Reductions.