Analysis of Algorithms. ((3 Credits))

Catalog description

Prerequisite(s): Matriculation into Computer Science or Software Engineering, and University Advanced Standing Develops and reinforces ability to write and mathematically analyze foundational computer algorithms. Includes formalizing NP-completeness, divide and conquer strategies, greedy algorithms, dynamic programming, backtracking, branch and bound, approximation algorithms and multicore parallelization. Lab access fee of $45 for computers applies.