The following directory lists the graduate courses which the University expects to offer, although the University in no way guarantees that all such courses will be offered in any given academic year, and reserves the right to alter the list if conditions warrant. 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: Department consent required; open to graduate students in the Computer Science and Engineering program, others with permission. Not open for credit to students who have passed CSE 3502. Recommended preparation: CSE 2050 and 2500.
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: 09-AUG-22 05.20.17.316132 AM
|Term||Class Number||Campus||Instruction Mode||Instructor||Section||Session||Schedule||Enrollment||Location||Credits||Grading Basis||Notes|
|1223 16052 1 001||Spring 2022||16052||Storrs||In Person||Goldin, Dina||001||Reg||TuTh 5:00pm‑6:15pm