Course Units: 1
Description:
This course focuses on the traditional, algorithmic theory of computation consisting of three subareas: (1) computability, (2) complexity theory, and (3) formal languages and automata. The topics include: Turing machines, decidability/undecidability, reducibility, Church-Turing thesis, context-free grammars/languages, push-down automata, finite automata, regular expressions/languages, and time/space complexity including NP-completeness.
Prerequisite notes: CSC 260 and CSC 310, both with a grade of C or higher
Required for major/minor:
None
Option for major/minor:
Computer Science Major
Computer Science Minor
|
