To filter and search by keywords in course titles, see the Course Search.
Courses by Subject Area
Click on the links below for a list of courses in that subject area. You may then click “View Classes” to see scheduled classes for individual courses.
Prerequisites: CSE 2050 or 2100; and 2500; open only to students in the School of Engineering, Cognitive Science majors, and declared Computer Science or Cognitive Science minors.
Grading Basis: Graded
Formal models of computation, such as finite state automata, pushdown automata, and Turing machines, and their corresponding elements in formal languages (regular, context-free, recursively enumerable). The complexity hierarchy. Church's thesis and undecidability. NP completeness. Theoretical basis of design and compiler construction.
Last Refreshed: 20-SEP-19 05.20.20.002631 AM
|1198 2977 1 001||Fall 2019||Storrs||In Person||Wu, Yufeng||001||Reg||TuTh 2:00pm‑3:15pm
|1203 4040 1 001||Spring 2020||Storrs||In Person||Goldin, Dina||001||Reg||TuTh 5:00pm‑6:15pm