COSC 320 - Algorithm Design and Analysis

3 Credits
Three lecture hours.

A single algorithmic imporovement can win over a decade of incremental hardware updates. This course focuses on concepts of algorithm design and methods of analysis. Topics include, asymptotic complexity, completeness and cocrrectness, divide and conquer, dynamic programming, greedy algorithms, amortized analysis, graph algorithms, branch and bound, approximation algorithims and heuristics, np-hard, and np-complete problems.

Prerequisite(s) COSC 220 and COSC 281 . Students must complete all classes with a grade of C or better.
Offered (OFFERED AS NEEDED)