Mar 29, 2024  
Graduate Record 2010-2011 
    
Graduate Record 2010-2011 [ARCHIVED RECORD]

CS 6161 - Design and Analysis of Algorithms


Analyzes concepts in algorithm design, problem solving strategies, proof techniques, complexity analysis, upper and lower bounds, sorting and searching, graph algorithms, geometric algorithms, probabilistic algorithms, intractability and NP-completeness, transformations, and approximation algorithms. Prerequisite: CS 432 or equivalent.



Credits: 3