CSCI 728 - Design and Analysis of Algorithms

3 Credits
This advanced course explores the design and analysis of algorithms, emphasizing their limitations and interrelations. Students will learn how to analyze a problem and determine its reducibility to a common problem with a current solution. The course explores topics including computational geometry, NP-completeness, approximation algorithms, dynamic programming, greedy algorithms, and reductions.

Course Learning Outcomes:
1. Evaluate computational geometry algorithms for efficiency.
2. Analyze the time and space complexity of algorithms using formal methods.
3. Apply dynamic programming, greedy algorithms, and other advanced techniques to solve computational problems.
4. Identify NP-complete problems through problem reducibility.