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 | |||||
SE 3306 Ka Yaw Teo | |||||
B | |||||
Search Results
| Name | Grades | Rating | |||
|---|---|---|---|---|---|
Not teaching in Spring 2026 | |||||
SE 3306 Ka Yaw Teo | |||||
B | |||||
Ka Yaw Teo
[email protected]Grades: 188
Median GPA: B
Mean GPA: 2.795
4.1
Professor rating
4.3
Difficulty
10
Ratings given
80%
Would take again
Mathematical Foundations of Software Engineering
SE 3306
Erik Jonsson School of Engineering and Computer Science
Boolean logic, first-order logic, models of first-order logic. Introduction to program verification, applications in software engineering. Completeness Theorem. Regular expressions, regular sets, finite-state machines, and applications in software engineering. Graph Theory, graph algorithms. Statecharts, Petri Nets and their role in software engineering. Credit cannot be received for both courses, CS 3305 and SE 3306. Double majors are required to take CS 3305. 3 credit hours.
Prerequisite: (CE 2305 or CS 2305) with a grade of C or better or equivalent.
Offering Frequency: Each semester
Grades: 1,111
Median GPA: A-
Mean GPA: 3.314
Click a checkbox to add something to compare.
Ka Yaw Teo
[email protected]Grades: 188
Median GPA: B
Mean GPA: 2.795
4.1
Professor rating
4.3
Difficulty
10
Ratings given
80%
Would take again
Mathematical Foundations of Software Engineering
SE 3306
Erik Jonsson School of Engineering and Computer Science
Boolean logic, first-order logic, models of first-order logic. Introduction to program verification, applications in software engineering. Completeness Theorem. Regular expressions, regular sets, finite-state machines, and applications in software engineering. Graph Theory, graph algorithms. Statecharts, Petri Nets and their role in software engineering. Credit cannot be received for both courses, CS 3305 and SE 3306. Double majors are required to take CS 3305. 3 credit hours.
Prerequisite: (CE 2305 or CS 2305) with a grade of C or better or equivalent.
Offering Frequency: Each semester
Grades: 1,111
Median GPA: A-
Mean GPA: 3.314
Click a checkbox to add something to compare.