CS 215: THEORY OF COMPUTATION
University of California, Riverside
4 Units, Lecture, 3 hours; research, 3 hours. Prerequisite(s): CS 150; graduate standing. Covers phrase structure grammars and languages; turing machines; relation of languages to automata; solvable and unsolvable problems; and theoretical limitations of computers. Also examines algorithmic complexity theory; polynomial reducibility; the classes P and NP; and correctness proofs. May be taken Satisfactory (S) or No Credit (NC) with consent of instructor and graduate advisor.
Average GPA: 3.31
Grade distribution records: 129 students across 6 terms.
Grade distribution
| Grade | Students | Percent |
|---|---|---|
| A+ | 9 | 7.0% |
| A | 21 | 16.3% |
| A- | 36 | 27.9% |
| B+ | 20 | 15.5% |
| B | 17 | 13.2% |
| B- | 12 | 9.3% |
| C+ | 2 | 1.6% |
| C | 2 | 1.6% |
| C- | 2 | 1.6% |
| D | 2 | 1.6% |
| F | 3 | 2.3% |
| NP | 3 | 2.3% |
Based on 129 student grade records across 6 terms and 3 professors.
Instructors
- Silas Richelson 54 students, Average GPA 3.52
- Marek Chrobak 39 students, Average GPA 2.91
- Amey Bhangale 36 students, Average GPA 3.38