Design and Analysis of Algorithms

Catalog description

This course provides a comprehensive introduction to the design and analysis of computer algorithms. Design techniques include divide-and-conquer, the greedy approach, and dynamic programming. Algorithm analysis topics include asymptotic notation, recurrence relations, time-space complexity, Turing machines, and NP-completeness. Algorithms for sorting, searching, hashing, and advanced data structures are examined.