CS 4820

CS 4820

Course information provided by the 2026-2027 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 CS 2800, CS 3110.

Distribution Requirements (SMR-AS)

Last 4 Terms Offered 2026SP, 2025FA, 2025SU, 2025SP

View Enrollment Information

Syllabi: none
  •   Regular Academic Session. 

  • 4 Credits Stdnt Opt

  •  6657 CS 4820   LEC 001

    • MWF
    • Aug 24 - Dec 7, 2026
    • Chattopadhyay, E

  • Instruction Mode: In Person

    Enrollment limited to: Computer Science (CS) majors. All others should add themselves to the waitlist during add/drop. See enrollment webpage for more details: https://www.cs.cornell.edu/courseinfo/enrollment/cs-4000-5000-level-courses
    For Bowers Computer and Information Science (CIS) Course Enrollment Help, please see: https://tdx.cornell.edu/TDClient/193/Portal/Home/