Analysis of Algorithms

Catalog description

This course introduces the student to the concepts and applications of algorithms via time and space complexity, lower and upper bounds, as well as the mathematical framework to measure these in iterative and recursive structures. Topics include: cryptography (RSA), directed and undirected graphs, tree structures, divide-and-conquer algorithms, transform and conquer algorithms, greedy algorithms, searching and sorting bounds and optimization, hashing, dynamic programming, data compression, P v NP, and heuristic arguments therein.