Apr 08, 2020  
2011-2012 Undergraduate Academic Catalog | Expires Aug. 2018 
    
2011-2012 Undergraduate Academic Catalog | Expires Aug. 2018 THIS CATALOG IS ARCHIVED. BE SURE YOU ARE ACCESSING THE MOST ACCURATE CATALOG FOR YOU.

Add to Portfolio

CS 416 - Algorithms and Complexity


This course presents advanced concepts in algorithm analysis. Algorithmic topics include the design and analysis of computer algorithms, divide and conquer techniques, dynamic programming, the greedy method, backtracking, algorithms for sorting and searching, graph computations, pattern matching, and NP-complete problems. Topics in the analysis of algorithms include the fundamentals of the theory of computation and complexity theory, computability, logic, the relationships between complexity classes, NP-completeness, P-completeness, and randomized computation.

Prerequisite: CS 316.

Credits:4 cr



Add to Portfolio