CSAS 4112 - Design and Analysis of Algorithms

Institution:

Seton Hall University

Subject:

Description:

Analysis of the complexity and validity of algorithms for the solution of problems in graph theory, combinatorics, systems programming, artificial intelligence and other fields. Randomized algorithms and amortized analysis. NP-completeness and undecidability. Prerequisite: CSAS 2124, 2126, MATH 1611. 3 credits

Credits:

3.00

Credit Hours:

Prerequisites:

Corequisites:

Exclusions:

Level:

Instructional Type:

Lecture

Notes:

Additional Information:

Historical Version(s):

Institution Website:

www.shu.edu

Phone Number:

(973) 761-9000

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.