| 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. |
