CS 6161

Design and Analysis of Algorithms

Course Description

Prerequisites

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. Prerequisite: CS 4102 or equivalent.