CPSC 5210 - Design and Analysis of Computer Algorithms

(3) Credit Hours

Algorithm design techniques including divide and conquer, greedy method, dynamic programming, search and traversal, backtracking, branch and bound, graph algorithms. Introduction to the theory of NP-completeness and to methods of coping with NP-complete problems. Introduction to parallel algorithms. Prerequisites: CPSC 5010 or placement, or department head approval. Differential Course Fee will be assessed. Standard letter grade.