CS 3100 - Models Of Computation

Institution:

University of Utah

Subject:

Computer Science

Description:

This course covers different models of computation and how they relate to the understanding and better design of real-world computer programs. As examples, we will study Turing machines that help define the fundamental limits of computing, Push-down Automata that help build language parsers, and Finite Automata that help build string pattern matchers. This course also covers the basics of designing correctly functioning programs, and introduces the use of mathematical logic through Boolean satisfiability methods. The course will involve the use of hands-on programming exercises written at a sufficiently high level of abstraction that the connections between theory and practice are apparent. Prerequisites: 'C-' or better in CS 2100 AND (Full Major status in Computer Science OR Computer Engineering OR Software Development

Credits:

3.00

Credit Hours:

Prerequisites:

Corequisites:

Exclusions:

Level:

Instructional Type:

Lecture

Notes:

Additional Information:

Historical Version(s):

Institution Website:

www.utah.edu

Phone Number:

(801) 581-7200

Regional Accreditation:

Northwest Commission on Colleges and Universities

Calendar System:

Semester

General Education

• No items found

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.