CMS 460 - Algorithms

Detailed study of algorithm design and analysis, including greedy algorithms, divide and conquer, dynamic programming, backtracking, and brance and bound. Emphasis on verification and analysis of time space complexity. NP theory is introduced. Prereq(s): CMS 270 and MAT 140.

Print this Page