- Schedule of Classes - August 31, 2016 7:14PM EDT
- Course Catalog - June 9, 2016 6:15PM EDT
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.
Summer Special Session 2.
Credits and Grading Basis
4 Credits Stdnt Opt(Letter or S/U grades)
Class Number & Section Details
- MTWRFHollister Hall 312
- May 26 - Jul 6, 2016
This Summer Session class is offered by the School of Continuing Education and Summer Sessions. For details visit http://www.sce.cornell.edu/ss/courses/courses.php?v=2954
Disabled for this roster.