CS 4820

CS 4820

Course information provided by the 2025-2026 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 2025FA, 2025SU, 2025SP, 2024FA

View Enrollment Information

Syllabi: none
  •   Regular Academic Session.  Choose one lecture and one project. Combined with: CS 5820

  • 4 Credits Opt NoAud

  •  4893 CS 4820   LEC 001

    • MWF
    • Jan 20 - May 5, 2026
    • Kim, M

  • Instruction Mode: In Person

    Enrollment limited to: Computer Science students.
    For Bowers Computer and Information Science (CIS) Course Enrollment Help, please see: https://tdx.cornell.edu/TDClient/193/Portal/Home/

  •  5897 CS 4820   PRJ 601

    • Jan 20 - May 5, 2026
    • Kim, M

  • Instruction Mode: In Person