Course description

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

Non-Cornell students must get permission of instructor to enroll.

Prerequisites

CS 2800 and 3110

Classes

No upcoming classes were found.

Previously offered classes

Summer 2020: Online course

Section ID:CS 4820 001-LEC
Number:1338
Class dates:May 26-July 2, 2020
Due date:Thursday July 02, 11:59 PM (see Final exams)
Time / room:
Mode of instruction:Online learning
Credit:4
Grade:Student option
Instructor:Erkan, A. (ase54)
Max. enroll:30
  This is an online course. Please review the online course FAQs.
To enroll:Enrollment for this class is closed.