CSE 204: Computatnl Models
University of California, Santa Cruz
Finite automata and regular expressions, universal models of computation, computability and unsolvability, relations between complexity classes, hierarchy theorems, reductions, complete problems for the major complexity classes (L, NL, P, NP, PSPACE). Other topics may include complexity of counting and enumeration problems, complexity of approximation, randomized complexity classes. (Formerly Computer Science 210.)
Average GPA: 3.80
Grade distribution records: 55 students across 3 terms.
Grade distribution
| Grade | Students | Percent |
|---|---|---|
| A+ | 5 | 9.1% |
| A | 33 | 60.0% |
| A- | 7 | 12.7% |
| B+ | 1 | 1.8% |
| B | 1 | 1.8% |
| C | 1 | 1.8% |
| F | 1 | 1.8% |
| S | 6 | 10.9% |
Based on 55 student grade records across 3 terms and 1 professor.
Instructors
- Seshadhri Comandur 55 students, Average GPA 3.80