Design and Analysis of Algorithms

Catalog description

This course focuses on algorithmic problem-solving techniques including decrease-and-conquer, divide-and-conquer, transform-and-conquer, dynamic programming, greedy design, backtracking, branch and bound, and heuristic algorithms. Advanced data structure techniques are studied within the context of designing efficient graph algorithms. Students gain an appreciation for the fundamental notion of NP completeness. The asymptotic analysis of algorithmic complexity is emphasized throughout the course.