My PlannerExplore and compare past grades, professor ratings, and reviews to find the perfect class.
Grades:
Median GPA:
Mean GPA:
Search Results
| Name | Grades | Rating |
|---|---|---|
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
Grades:
Median GPA:
Mean GPA:
5.0
Professor rating
5.0
Difficulty
1,000
Ratings given
99%
Would take again
Visit Rate My Professors
Grades:
Median GPA:
Mean GPA:
Search Results
| Name | Grades | Rating |
|---|---|---|
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
Search Results
| Name | Grades | Rating |
|---|---|---|
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
Search Results
| Name | Grades | Rating |
|---|---|---|
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
Search Results
| Name | Grades | Rating | |||
|---|---|---|---|---|---|
Not teaching in Spring 2026 | |||||
CS 4384 Hemant Malik | |||||
B+ | |||||
Search Results
| Name | Grades | Rating | |||
|---|---|---|---|---|---|
Not teaching in Spring 2026 | |||||
CS 4384 Hemant Malik | |||||
B+ | |||||
Hemant Malik
[email protected]Grades: 215
Median GPA: B+
Mean GPA: 3.063
2.7
Professor rating
3.8
Difficulty
6
Ratings given
33%
Would take again
Automata Theory
CS 4384
Erik Jonsson School of Engineering and Computer Science
A review of the abstract notions encountered in machine computation. Deterministic and nondeterministic finite automata; regular expressions, regular sets, context-free grammars, pushdown automata, context-free languages. Selected topics from Turing Machines and undecidability. 3 credit hours.
Prerequisite: (CE 2305 or CS 2305) with a grade of C or better.
Offering Frequency: Each semester
Grades: 5,689
Median GPA: B+
Mean GPA: 3.113
Click a checkbox to add something to compare.
Hemant Malik
[email protected]Grades: 215
Median GPA: B+
Mean GPA: 3.063
2.7
Professor rating
3.8
Difficulty
6
Ratings given
33%
Would take again
Automata Theory
CS 4384
Erik Jonsson School of Engineering and Computer Science
A review of the abstract notions encountered in machine computation. Deterministic and nondeterministic finite automata; regular expressions, regular sets, context-free grammars, pushdown automata, context-free languages. Selected topics from Turing Machines and undecidability. 3 credit hours.
Prerequisite: (CE 2305 or CS 2305) with a grade of C or better.
Offering Frequency: Each semester
Grades: 5,689
Median GPA: B+
Mean GPA: 3.113
Click a checkbox to add something to compare.