CSE 5211 Analysis of Algorithms

Credit Hours: 3

Presents time and space complexity of computer algorithms. Includes algorithm classes, such as divide-and-conquer, greedy, dynamic programming and backtracking; techniques for solving recurrence equations; graph algorithms; searching and sorting; and deterministic and nondeterministic polynomial time problem classes.
Recommended: Background knowledge equivalent to CSE 2010 and MTH 1002