COT 5405 - Algorithms and Complexity

Institution:

University of North Florida

Subject:

COT-Computing Theory

Description:

Prerequisites: COT 3210, COP 3530. For beginning graduate students. Analysis of various algorithm design strategies, divide-and-conquer, greedy method, backtracking, branch-and-bound, lower bound theory, NP-hard and NP-complete. Students will extend course topics via library assignments or other instructor assigned requirements.

Credits:

3.00

Credit Hours:

Prerequisites:

Corequisites:

Exclusions:

Level:

Instructional Type:

Lecture

Notes:

Additional Information:

Historical Version(s):

Institution Website:

www.unf.edu

Phone Number:

(904) 620-1000

Regional Accreditation:

Southern Association of Colleges and Schools

Calendar System:

Semester

The Course Profile information is provided and updated by third parties including the respective institutions. While the institutions are able to update their information at any time, the information is not independently validated, and no party associated with this website can accept responsibility for its accuracy.