 | | | | |
Home»Graduate Education»Courses»Graduate Course Descriptions»CSE201
| | | | | Graduate Course Descriptions
CSE201 - Applied Computability and Complexity
(Deleted Fall 2002)
Units: 4
Course Description:
Models of Computation: Finite Automata, Context-free Grammars, Turning Machines, Random Access Machines and Circuits. Undecidability. First Order Logic. Complexity: Time and Space, Theory of NP and P, Intractability. Intended for students in the computer engineering program.
Prerequisites:
CSE 165 or CSE 206 or equivalent
| | | back to top ^ |
| |
