Theory of Algorithms

Catalog description

Students will engage in problem-solving strategies, including divide and conquer, greedy, backtracking, and dynamic programming; will focus on the complexity analysis of algorithms; and will be introduced to complexity classes P and NP, with strategies for NP-complete problems. (offered in alternate years)