MAT 260 - Analysis of Algorithms

Prerequisite(s): MAT 124 with a grade of “C-” or better and successful completion of one computer programming language course.
This course is a rigorous introduction to the design and analysis of algorithms. Included are discussions of classic problems (e. g. , sorting, traveling, salesman problems), classic algorithm design strategies (e. g. , divide-and-conquer, greedy approaches), and classic algorithms and data structures (e. g. , hash tables, Dijkstra’s algorithm) as well as algorithm complexity and issues of tractability, such as “NP-Completeness. ” On demand

Hours: 3