CS 3120
Discrete Mathematics and Theory 2
Course Description
Prerequisites
CS 3100 with a grade of C- or better
The goal of this course is to understand the fundamental limits on what can be efficiently computed. These limits reveal properties about information, communication, and computing, as well as practical issues about how to solve problems. Introduces computation theory including grammars, automata, and Turing machines. Prereq: CS 3100 with a grade of C- or better
Instructors
Mark Floryan
Fall 2026
tuth 11:00am - 12:15pm
3.2
Rating
4.2
Difficulty
3.09
GPA
Wei-Kai Lin
Spring 2026
tuth 9:30am - 10:45am
2.3
Rating
4.0
Difficulty
3.05
GPA
Raymond Pettit
Spring 2026
tuth 2:00pm - 3:15pm
4.0
Rating
4.0
Difficulty
2.82
GPA
Faculty Staff
Summer 2025
motuwethfr 10:30am - 12:45pm
—
Rating
—
Difficulty
—
GPA
David Evans
Spring 2023
TuTh 9:30am - 10:45am
—
Rating
—
Difficulty
3.83
GPA
Mohammad Mahmoody
Spring 2023
TuTh 9:30am - 10:45am
—
Rating
—
Difficulty
—
GPA
Nathan Brunelle
Fall 2022
MoWe 3:30pm - 4:45pm
—
Rating
—
Difficulty
—
GPA