COSC 445 - Design and Analysis of Algorithms

Credit Hours: 4
Frequency of Offering: Offered in alternate years, usually in the spring semester

This course studies the design, implementation and analysis of important algorithms. Topics include lower and upper complexity bounds, algorithm analysis techniques, NP-completeness, sorting algorithms, searching algorithms, graph algorithms, divide-and-conquer algorithms, greedy algorithms, dynamic programming, backtracking, probabilistic algorithms, and mathematical algorithms. Not open to students who have received credit for COSC 340. Formerly COSC 340.

Prerequisite(s): COSC 201; and MATH 200 or MATH 281.