CS 4820

Course information provided by the Courses of Study 2017-2018.

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.

Prerequisites/Corequisites Prerequisite: CS 2800 and CS 3110. Students who got an A- or better in both CS 2800 and CS 2110 are welcome to take CS 4820 without CS 3110.

View Enrollment Information

Enrollment Information
Syllabi: none
  •  

  • 4 Credits Stdnt Opt

  • 10674CS 4820  LEC 001

    • MWF
    • Kleinberg, R

  • Enrollment open to CIS students only. All others should add themselves to the waitlist. Please go to http://www.cs.cornell.edu/courseinfo/enrollment for updates.