CIS 522 - Algorithms and Complexity

Institution:

University of Massachusetts-Dartmouth

Subject:

Computer and Information Science

Description:

Prerequisites: CIS 360 or equivalent, or permission of instructor Evaluation of algorithms concerning their time and space complexity. Complexity hierarchies, axiomatic approach to computational complexity, NP complete problems, approximation algorithms for these problems.

Credits:

3.00

Credit Hours:

Prerequisites:

Corequisites:

Exclusions:

Level:

Instructional Type:

Lecture

Notes:

Additional Information:

Historical Version(s):

Institution Website:

www.umassd.edu

Phone Number:

(508) 999-8000

Regional Accreditation:

New England Association of Schools and Colleges

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.