Analysis of Algorithms

Catalog description

This course covers the design and analysis of algorithms. Topics include Turing machines; NP-complete theory; best, average, and worst-case analysis; divide-and-conquer; greedy method; dynamic programming; graph traversal; backtracking and branch-and bound techniques. The course also covers sorting, searching, graph algorithms, and optimization.