CPS 3440 - Advanced Algorithms and Complexity Theory

Institution:

Kean University

Subject:

Description:

Algorithmic analysis. Measures of complexity. Best case, worst case, and average behavior. Algorithms involving sorting, graphs, networks, and number theory. NP-Completeness. Prerequisites: Completion of CPS Core, MATH 2110 and MATH 2412.

Credits:

3.00

Credit Hours:

Prerequisites:

Corequisites:

Exclusions:

Level:

Instructional Type:

Lecture

Notes:

Additional Information:

Historical Version(s):

Institution Website:

www.kean.edu

Phone Number:

(908) 737-5326

Regional Accreditation:

Middle States 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.