Introduction to the Analysis of Algorithms

Catalog description

A grade of ‘C’ or better in CSCI 220, MATH 174, and MATH 160 Study of algorithm design and analysis techniques, including correctness, efficiency, and asymptotic complexity. Topics include basic algorithmic strategies such as divide and conquer, greedy methods, and dynamic programming, along with analysis of time and space requirements. Emphasis on reasoning about algorithm performance and comparing alternative solutions to computational problems. Semester(s) Offered: Fall, Spring