CS 4820

Course information provided by the Courses of Study 2015-2016.

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

When Offered Spring, summer.

Prerequisites/Corequisites Prerequisite: CS 2800 and CS 3110.

View Enrollment Information

Enrollment Information
Syllabi: none
  •  

  • 4 Credits Stdnt Opt

  • 10875CS 4820  LEC 001

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