CS 4820

CS 4820

Course information provided by the Courses of Study 2021-2022.

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).

When Offered Fall, Spring, Summer.

Prerequisites/Corequisites Prerequisite: CS 2800, CS 3110. 

Distribution Category (SMR-AS)

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

  •   Regular Academic Session.  Combined with: CS 5820

  • 4 Credits Stdnt Opt

  • 10036 CS 4820   LEC 001

    • MWF Uris Hall G01
    • Jan 24 - May 10, 2022
    • Chattopadhyay, E

  • Instruction Mode: In Person
    Enrollment open to CIS students only. All others should add themselves to the waitlist during add/drop in January.