COSC 3207EL

Algorithm Design and Analysis

Lec 01 selected

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.

Sections

Lecture

Lec 01

Mon, Thu 13:00-14:20

Mon, Thu13:00-14:20Classroom Building C-1121414

Syllabus

Have the syllabus for COSC 3207EL? Share it and everyone gets the grading, textbooks and rules.