CSCI 3501 - Algorithms and Computability

Institution:

University of Minnesota-Morris

Subject:

Description:

Models of computation (Turing machines, lambda calculus, deterministic and non-deterministic machines); approaches to the design of algorithms, determining correctness and efficiency of algorithms; complexity classes, NP-completeness, approximation algorithms. (4 hrs lect, 2 hrs lab)

Credits:

4.00

Credit Hours:

Prerequisites:

Corequisites:

Exclusions:

Level:

Instructional Type:

Lecture

Notes:

Additional Information:

Historical Version(s):

Institution Website:

www.morris.umn.edu/

Phone Number:

(320) 589-6035

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.