CSCE 500 - Design and Analysis of Algorithms

Credit Hours: 3
Lecture Contact Hours: 3 Lab Contact Hours: 0

Basic techniques used in design and analysis of algorithms, including divide-and-conquer, greedy methods, dynamic programming, search techniques, backtracking, brand-and-bound, and algebraic transformation. NP-Complete and NP-Hard problems, reductions among and approximations to such problems. Basis concepts surrounding the halting problem.

Prerequisite(s): CMPS 341 or CMPS 406