Introduction to the theory of computation. Automata theory; finite state machines, context free grammars, and Turing machines; hierarchy of formal language classes. Computability theory and undecidable problems. Time complexity; P and NP-complete problems. Applications to software design and security.
10 terms
California State University, Fullerton
CPSC 439 at CSUF: average GPA 2.81 across 336 students. Grade distribution by term. Introduction to the theory of computation. Automata theory; finite state…
Average GPA: 2.81
Grade distribution records: 336 students across 10 terms.
| Grade | Students | Percent |
|---|---|---|
| A+ | 1 | 0.3% |
| A | 86 | 25.6% |
| A- | 12 | 3.6% |
| B+ | 6 | 1.8% |
| B | 100 | 29.8% |
| B- | 13 | 3.9% |
| C+ | 3 | 0.9% |
| C | 84 | 25.0% |
| C- | 3 | 0.9% |
| D | 17 | 5.1% |
| F | 11 | 3.3% |
Based on 336 student grade records across 10 terms and 6 professors.
The course page is taking longer to load. This summary is still available.
We could not load the full course details. This summary is still available.
Still loading. This can take a moment on a slow connection.
Loading My Class Grades