Algorithm Design and Analysis

This course develops fundamental skills in designing and analyzing algorithms. Topics include string matching, graph algorithms, geometric algorithms, optimization techniques, and linear programming. The concepts of solvability and NP-completeness are introduced. PREREQ: COSC 2006. (lec 3) cr 3. Students may not retain credit for both COSC 3207 and COSC 4106.

COSC-3207EL
Mathematics & Computer Science
3.00
UG