CS 5820

CS 5820

Course information provided by the Courses of Study 2024-2025.

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

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

  • 4 Credits Opt NoAud

  •  7504 CS 5820   LEC 001

    • MWF
    • Jan 21 - May 6, 2025
    • Kim, M

  • Instruction Mode: In Person
    Enrollment limited to: Master of Engineering (M.Eng.) Computer Science (CS) students and Computer Science Early Admit students.
    For Bowers Computer and Information Science (CIS) Course Enrollment Help, please see: https://tdx.cornell.edu/TDClient/193/Portal/Home/

  •  8944 CS 5820   PRJ 601

    • TBA
    • Jan 21 - May 6, 2025
    • Kim, M

  • Instruction Mode: In Person