Analysis of Algorithms

Catalog description

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. Restricted to Computer Science M.S. (8071), Software Engineering M.S. (8050), Cybersecurity M.S. (8099) and Computer Science Ph.D. (9071) students. Other students need approval from the instructor. Recommended: Background knowledge equivalent to CSE 2010 Algorithms and Data Structures and MTH 1002 Calculus 2 .