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: 06-MAY-21 05.20.19.123041 AM
|1218 4258 1 001||Fall 2021||Storrs||In Person||Goldin, Dina||001||Reg||MoWe 5:00pm‑6:15pm
|1218 12955 1 Z81||Fall 2021||Stamford||In Person||Bhargava, Kriti||Z81||Reg||MoWeFr 11:15am‑12:05pm
||No Room Required - Online||4/15|