CS 6045:Advanced Algorithms

3 Credit Hours
Prerequisite: CS 5040 and CS 5070
This course covers advanced algorithm design strategies and analysis using formal and mathematical techniques. Topics include asymptotic analyses of complexity bounds using big-O, little-o, omega, and theta notations. The algorithmic strategies (brute-force, greedy, divide-and-conquer, recursive backtracking, dynamic programming, branch-and-bound, heuristics, and space-and-time tradeoffs) are covered. Also included are standard graph and tree algorithms. Additional topics may include amortized analysis, NP completeness, basic approximate algorithms, and introduction to polynomial reduction.