Dec 07, 2019  
2012-2013 Graduate Catalog 
    
2012-2013 Graduate Catalog Archived Catalog

[Add to Portfolio]

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. Prerequisite: CPSC 5010 or equivalent. Supplementary course fee assessed.



[Add to Portfolio]