CS 5820

CS 5820

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


Last 4 terms offered (None)

View Enrollment Information

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

  • 4 Credits Opt NoAud

  •  5118 CS 5820   LEC 001

    • MWF
    • Aug 25 - Dec 8, 2025
    • Chattopadhyay, E

  • Instruction Mode: In Person

    Direct enrollment is restricted to Computer Science (CS), Doctor of Philosophy (PhD), Master of Science (MS), and Master of Engineering (M.Eng.) students. Seniors taking courses for M.Eng credit and all other graduate and professional students must add themselves to the waitlist during add/drop. See website for details: http://www.cs.cornell.edu/courseinfo/enrollment/cs-4000-5000-level-courses
    For Bowers CIS Course Enrollment Help, please see: https://tdx.cornell.edu/TDClient/193/Portal/Home/

  •  7151 CS 5820   PRJ 601

    • TBA
    • Aug 25 - Dec 8, 2025
    • Chattopadhyay, E

  • Instruction Mode: In Person