CS 4820

Last Updated

  • Schedule of Classes - June 22, 2015 4:42PM EDT
  • Course Catalog - June 11, 2015 6:21PM EDT

CS 4820
Introduction to Analysis of Algorithms

Course information provided by the 2014-2015 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 Prerequisites: CS 2800 and CS 3110.

When Offered Spring, summer.

View Enrollment Information

Syllabi: none

  •   Regular Academic Session. 

  • 4 Credits Stdnt Opt

  • 11231 CS 4820   LEC 001

  •  
    • MWF Uris Hall G01

    • Steurer, D

      Tardos, E

  • Instruction Mode: In Person

    Pre-enrollment open only to CS students. Please go to http://www.cs.cornell.edu/courseinfo/enrollment for updates.