CS 4820 - Introduction to Analysis of Algorithms

Spring, summer. 4 credits.

Prerequisite: CS 2800 and CS 3110.

Staff.

Develops techniques used in the design and analysis of algorithms, with an emphasis on problems arising in computing applications. Example applications are drawn from systems and networks, artificial intelligence, computer vision, data mining, and computational biology. This course covers four major algorithm design techniques (greedy algorithms, divide- nd- onquer, dynamic programming, and network flow), computability theory focusing on undecidability, computational complexity focusing on NP-completeness, and algorithmic techniques for intractable problems (including identification of structured special cases, approximation algorithms, and local search heuristics).