Analysis of Algorithms

Catalog description

Study methods for designing, analyzing, and implementing algorithms and data structures. The course explores formal and precise mechanisms for analyzing efficiency and verifying correctness and both iterative and recursive algorithms. Studies also cover a variety of fundamental algorithms, abstract data types, and data structures. Algorithm design strategies included greedy, divide-and-conquer, exhaustive search, and dynamic programming. Additional topics may include approximation, parallel, or randomized algorithms. Prerequisite: Computer Science 207 and either Mathematics 218 or Computer Science/Mathematics 208. STAFF.