CS 3102
Theory of Computation
Course Description
Prerequisites
(CS 2102 or CS 2120) and (CS 2100 or CS 2110 or CS 2501 topic "DSA 2" or the CS 2110 placement test); both with grades of C- or higher
Introduces computation theory including grammars, finite state machines, pushdown automata, and Turing machines.Prerequisites: (CS 2102 or CS 2120) and (CS 2100 or CS 2110 or CS 2501 topic "DSA 2" or the CS 2110 placement test); both with grades of C- or higher.
Instructors
Nathan Brunelle
Fall 2022
MoWe 3:30pm - 4:45pm
3.4
Rating
3.4
Difficulty
3.64
GPA
Faculty Staff
Spring 2022
—
Rating
—
Difficulty
—
GPA
David Evans
Fall 2021
3.0
Rating
3.0
Difficulty
3.71
GPA
Co-taught Evans
Fall 2019
—
Rating
—
Difficulty
—
GPA
Dimitrios Diochnos
Fall 2018
—
Rating
—
Difficulty
3.50
GPA
Gabriel Robins
Spring 2018
2.8
Rating
2.9
Difficulty
3.25
GPA
Worthy Martin
Fall 2015
2.8
Rating
4.0
Difficulty
2.83
GPA
Abhi Shelat
Fall 2010
—
Rating
—
Difficulty
2.95
GPA