Computer Science 39 - Theory of Computation

Institution:

Dartmouth College

Subject:

Description:

09W: 11 10W: Arrange This course serves as an introduction to formal models of languages and computation. Topics covered include finite automata, regular languages, context-free languages, pushdown automata, Turing machines, computability, and NP-completeness. Prerequisite: Computer Science 25 (students who have not taken Computer Science 25, but have a strong mathematical background, may take Computer Science 39 with permission of the instructor). Dist: QDS. Chakrabarti.

Credits:

3.00

Credit Hours:

Prerequisites:

Corequisites:

Exclusions:

Level:

Instructional Type:

Lecture

Notes:

Additional Information:

Historical Version(s):

Institution Website:

www.dartmouth.edu

Phone Number:

(603) 646-1110

Regional Accreditation:

New England Association of Schools and Colleges

Calendar System:

Quarter

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.