Course Description for Algorithms and Complexity
Algorithms and Complexity
Prerequisite: COT 3210 and COP 3530
Description: This course is reserved for beginning graduate students lacking background in this area. Topics include analysis of various algorithm design strategies, divide-and-conquer, greedy method, backtracking, branch-and-bound, lower bound theory, and, NP-hard and NP-complete. Students will extend course topics via library assignments or other instructor assigned requirements.