Algorithm Design and Analysis.

Catalog description

Students examine the fundamental principles and paradigms of algorithm design and analysis, with a focus on their correctness, efficiency, and theoretical basis. Topics may include divide-and-conquer, greedy algorithms, dynamic programming, backtracking, branch and bound, randomized algorithms, and problem reduction and transform. Core concepts in computational complexity and computability theory are also introduced.