CS 6161
Design and Analysis of Algorithms
Course Description
Pre-Requisite(s):
CS 4102 or equivalent
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.
Looks like this course isn't being taught this semester.
Sort by "All" in the top right to see previous semesters.
