CMSC452
Elementary Theory of Computation
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 2024
19 reviews
Average rating:
4.26
Spring 2023
84 reviews
Average rating:
2.80
Past Semesters
19 reviews
Average rating:
4.26
84 reviews
Average rating:
2.80
84 reviews
Average rating:
2.80
* "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.