CS 150: AUTOMATA AND FORMAL LANGUAGES
University of California, Riverside
4 Units, Lecture, 3 hours; discussion, 1 hour. Prerequisite(s): CS 010C with a grade of C- or better; CS 111; MATH 009C or MATH 09HC. A study of formal languages. Includes regular and context-free languages; computational models for generating these languages such as finite-state automata, pushdown automata, regular expressions, and context-free grammars; mathematical properties of the languages and models; and equivalence between the models. Also introduces Turing machines and decidability.
Average GPA: 3.35
Grade distribution records: 2,997 students across 33 terms.
Grade distribution
| Grade | Students | Percent |
|---|---|---|
| A+ | 497 | 16.6% |
| A | 937 | 31.3% |
| A- | 382 | 12.7% |
| B+ | 253 | 8.4% |
| B | 282 | 9.4% |
| B- | 150 | 5.0% |
| C+ | 107 | 3.6% |
| C | 123 | 4.1% |
| C- | 62 | 2.1% |
| D+ | 31 | 1.0% |
| D | 41 | 1.4% |
| D- | 29 | 1.0% |
| F | 70 | 2.3% |
| NP | 2 | 0.1% |
| S | 13 | 0.4% |
| W | 18 | 0.6% |
Based on 2,997 student grade records across 33 terms and 2 professors.
Instructors
- Tao Jiang 1,147 students, Average GPA 3.03
- Paea Lependu 873 students, Average GPA 3.60