Description

This course will introduce you to algorithms in a variety of areas of interest, such as sorting, searching, string-processing, and graph algorithms. You will learn to study the performance of various algorithms within a formal, mathematical framework. You will also learn how to design very efficient algorithms for many kinds of problems. There will be one or more programming assignments as well to help you relate the empirical performance of an algorithm to theoretical predictions. Mathematical experience (as provided by CMPSCI 250) is required. You should also be able to program in Java, C, or some other closely related language.
Prerequisite: CMPSCI 250 or MATH 455. 4 credits.

General Information

Course syllabus and reading
Please click the syllabus button on the top left of the page. Alternately, please see the resources page.
Course information and mechanics
Please see resources page for the first handout.
Required Textbook
Introduction to Algorithms, 3rd Edition, by Cormen, Leiserson, Rivest, Stein. All readings in the syllabus refer to this textbook,

Announcements

Announcements are not public for this course.
Staff Office Hours
NameOffice Hours
Ramesh Sitaraman
When?
Where?
Cooper Sigrist
When?
Where?