CS 5820

CS 5820

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.

View Enrollment Information

  •   Regular Academic Session.  Combined with: CS 4820

  • 4 Credits Stdnt Opt

  • 18803 CS 5820   LEC 001

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

  • Instruction Mode: In Person
    Enrollment restricted to CS MEng students only. All others, including early admits must add themselves to the waitlist during add/drop in January.