CMSC452

Elementary Theory of Computation

Reviews for this courseTestudo

Prerequisite: Minimum grade of C- in CMSC351; and permission of CMNS-Computer Science department. Or must be in the (Computer Science (Doctoral), Computer Science (Master's)) program. Techniques are developed to determine the difficulty of a problem relative to a model of computation. Topics include Finite Automata, P, NP, decidability, undecidability, and communication complexity.

Spring 2026

Binghui Peng

0 reviews
Average rating: N/A

Spring 2025

William Gasarch

11 reviews
Average rating: 4.64

Past Semesters

William Gasarch

11 reviews
Average rating: 4.64

Clyde Kruskal

0 reviews
Average rating: N/A

Clyde Kruskal

0 reviews
Average rating: N/A

Clyde Kruskal

0 reviews
Average rating: N/A

William Gasarch

11 reviews
Average rating: 4.64

During the Spring 2020 and Spring 2021 semesters, students could choose to take some of their courses pass-fail mid-semester which skews grade data aggregated across multiple semesters.

Average GPA of 2.90 between 477 students*

CMSC452 Grade Distribution+-0510152025303540% of studentsABCDFWother
A-: 2.31%
A: 28.09%
A+: 6.29%
B-: 3.77%
B: 21.59%
B+: 4.82%
C-: 6.5%
C: 12.79%
C+: 5.66%
D: 2.94%
F: 0.21%
W: 5.03%
* "W"s are considered to be 0.0 quality points. "Other" grades are not factored into GPA calculation. Grade data not guaranteed to be correct.