Turing machines, decidability, recursive enumerability; many-to-one and polynomial-time reductions; NP-completeness, Cook-Levin Theorem; Recursion Theorem. Prereq: 3321 (625) or 5321. Not open to students with credit for 725.
8 terms
Other grades
Ohio State University
CSE 6321 at Ohio State: average GPA 3.48 across 129 students. Grade distribution by term. Turing machines, decidability, recursive enumerability; many-to-one…
Average GPA: 3.48
Grade distribution records: 129 students across 8 terms.
| Grade | Students | Percent |
|---|---|---|
| A | 50 | 38.8% |
| A- | 20 | 15.5% |
| B+ | 18 | 14.0% |
| B | 14 | 10.9% |
| B- | 15 | 11.6% |
| C+ | 2 | 1.6% |
| C | 2 | 1.6% |
| F | 1 | 0.8% |
| W | 7 | 5.4% |
Based on 129 student grade records across 8 terms and 3 professors.
Also in CSE
Also in CSE
Also in CSE
Also in CSE
Also in CSE
Also in CSE
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