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.

No upcoming classes were found.

Previously offered classes

Summer 2022: Ithaca campus

Section ID:CS 4820 001-LEC
Number:1309
Session:Summer Extra-session
Class dates:May 31-July 8, 2022
Final exam/project due:Friday July 08, 8:30 AM - 10 AM / Hollister Hall 206 (see Final exams)
Time / room:M-F 8:30 AM - 10 AM / Hollister Hall 206
Mode of instruction:In person
Credit:4
Grade:Student option
Instructor:Erkan, A. (ase54)
Max. enroll:45
To enroll:Enrollment for this class is closed.