EECS 454 - Analysis of Algorithms

Institution:

Case Western Reserve University

Subject:

Description:

This course presents and analyzes a number of efficient algorithms. Problems are selected from such problem domains as sorting, searching, set manipulation, graph algorithms, matrix operations, polynomial manipulation, and fast Fourier transforms. Through specific examples and general techniques, the course covers the design of efficient algorithms as well as the analysis of the efficiency of particular algorithms. Certain important problems for which no efficient algorithms are known (NP-complete problems) are discussed in order to illustrate the intrinsic difficulty which can sometimes preclude efficient algorithmic solutions. Recommended preparation for EECS 454: MATH 304 and (EECS 340 or EECS 405). Offered as EECS 454 and OPRE 454.

Credits:

3.00

Credit Hours:

Prerequisites:

Corequisites:

Exclusions:

Level:

Instructional Type:

Lecture

Notes:

Additional Information:

Historical Version(s):

Institution Website:

www.case.edu

Phone Number:

(216) 368-2000

Regional Accreditation:

North Central Association of Colleges and Schools

Calendar System:

Semester

The Course Profile information is provided and updated by third parties including the respective institutions. While the institutions are able to update their information at any time, the information is not independently validated, and no party associated with this website can accept responsibility for its accuracy.