Algorithm Design

Catalog description

Algorithms, being the foundation of computing, allow us to create well-defined sequences of computational steps in order to solve computational problems – with stipulation on input/out relation, correctly and efficiently within a definite time frame. This course provides a comprehensive introduction to the modern study of computer algorithms. In particular, we will study the design and analysis of algorithms with special emphasis on correctness of algorithms, asymptotic notations, divide-and-conquer, dynamic programming, greedy algorithms, graph algorithms, shortest paths, and selected special topics. Prerequisites: CSCI 520 with a minimum grade of C.