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+ | ||
Timothy Farage
[email protected]Grades: 3,084
Median GPA: A
Mean GPA: 3.569
4.2
Professor rating
2.1
Difficulty
236
Ratings given
78%
Would take again
Discrete Mathematics for Computing I
CS 2305 (Same as CE 2305)
Erik Jonsson School of Engineering and Computer Science
Principles of counting. Boolean operations. Logic and proof methods. Recurrence relations. Sets, relations, functions. Elementary graph theory. Elementary number theory. 3 credit hours.
Prerequisite: (MATH 2413 or MATH 2417) with a grade of C or better.
Offering Frequency: Each semester
Grades: 9,222
Median GPA: B
Mean GPA: 2.964
Click a checkbox to add something to compare.
Timothy Farage
[email protected]Grades: 3,084
Median GPA: A
Mean GPA: 3.569
4.2
Professor rating
2.1
Difficulty
236
Ratings given
78%
Would take again
Discrete Mathematics for Computing I
CS 2305 (Same as CE 2305)
Erik Jonsson School of Engineering and Computer Science
Principles of counting. Boolean operations. Logic and proof methods. Recurrence relations. Sets, relations, functions. Elementary graph theory. Elementary number theory. 3 credit hours.
Prerequisite: (MATH 2413 or MATH 2417) with a grade of C or better.
Offering Frequency: Each semester
Grades: 9,222
Median GPA: B
Mean GPA: 2.964
Click a checkbox to add something to compare.
Search Results
| Name | Grades | Rating | |||
|---|---|---|---|---|---|
Not teaching in Spring 2026 | |||||
CS 2305 Timothy Farage | |||||
A | |||||
Search Results
| Name | Grades | Rating | |||
|---|---|---|---|---|---|
Not teaching in Spring 2026 | |||||
CS 2305 Timothy Farage | |||||
A | |||||