CMSC 410 - Theoretical Foundations of Computer Science

Institution:

Shippensburg University of Pennsylvania

Subject:

Description:

Topics include finite automata, regular languages, regular expressions, and regular grammars; pushdown automata and context-free languages; Turing machines; Church-Turing Thesis; the Halting Problem; undecidability; classes of languages, including the Chomsky hierarchy and the classes P, NP, and NP-Complete. Proof techniques for showing language (non)membership in a class. This course is not available for graduate credit.

Credits:

3.00

Credit Hours:

Prerequisites:

CMSC 310 (Grade of C or Higher)

Corequisites:

Exclusions:

Level:

Instructional Type:

Lecture

Notes:

Additional Information:

Historical Version(s):

08/15/2017 - 08/25/2024 

Institution Website:

www.ship.edu/

Phone Number:

(717) 477-7447

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.