CS 4820

CS 4820

Course information provided by the 2015-2016 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- nd- onquer, dynamic programming, and network flow), computability theory focusing on undecidability, computational complexity focusing on NP-completeness, and algorithmic techniques for intractable problems (including identification of structured special cases, approximation algorithms, and local search heuristics).


Prerequisites/Corequisites Prerequisite: CS 2800 and CS 3110.

When Offered Spring, summer.

View Enrollment Information

Syllabi: none
  •   Regular Academic Session. 

  • 4 Credits Stdnt Opt

  • 10875 CS 4820   LEC 001

  • Instruction Mode: In Person

    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.