CS 4820

Introduction to Analysis of Algorithms

Course Description

Course information provided by the 2024-2025 Catalog.

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-and-conquer, dynamic programming, and network flow), undecidability and NP-completeness, and algorithmic techniques for intractable problems (including identification of structured special cases , approximation algorithms, local search heuristics, and online algorithms).

Prerequisites/Corequisites Prerequisite: CS 2800, CS 3110. 

Last 4 terms offered 2025SP, 2024FA, 2024SU, 2024SP

Distribution Category (SMR-AS)

When Offered Fall, Spring, Summer.

Comments Students who got an A- ​(or, when taken in Spring 2020, C- or S) or better in both CS 2800 and CS 2110 are welcome to take CS 4820 without CS 3110.

View Enrollment Information