CS 4820 Introduction to Analysis of Algorithms
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.
CS 2800 and 3110
CS 4820 001-LEC On-campus program: Engineering Cooperative Education Program
|Class dates:||May 24-July 4, 2018|
|Exam dates:||Will be provided by instructor (see Final exams)|
|Days/times:||M-F 8:30 AM - 9:45 AM Hollister Hall 312|
|Instructor:||Erkan, A. (ase54)|
|Notes:||Non-Cornell students must get permission of instructor to enroll.|
|Tuition:||Please see Engineering Co-op tuition.|
|To enroll:||To enroll, complete and submit a course enrollment form and your payment to the Summer Session office. For more information, see enrollment and registration. Please note that late registration fees may apply.|