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 3305 Ravi Prakash | |||||
A- | |||||
Search Results
| Name | Grades | Rating | |||
|---|---|---|---|---|---|
Not teaching in Spring 2026 | |||||
CS 3305 Ravi Prakash | |||||
A- | |||||
Grades: 1,223
Median GPA: A-
Mean GPA: 3.413
3.8
Professor rating
3.6
Difficulty
64
Ratings given
60%
Would take again
Discrete Mathematics for Computing II
CS 3305
Erik Jonsson School of Engineering and Computer Science
Advanced counting methods; recurrence relations, divide and conquer algorithms, principle of inclusion and exclusion. Partial orders and lattices, Algorithmic complexity. Graph theory. Strings and languages. Number theory. Elements of modern algebra. Credit cannot be received for both courses, CS 3305 and SE 3306. Double majors are required to take CS 3305. 3 credit hours.
Prerequisites: (CE 2305 or CS 2305) with a grade of C or better, and (MATH 2414 or MATH 2419).
Offering Frequency: Each semester
Grades: 6,541
Median GPA: B+
Mean GPA: 3.232
Click a checkbox to add something to compare.
Grades: 1,223
Median GPA: A-
Mean GPA: 3.413
3.8
Professor rating
3.6
Difficulty
64
Ratings given
60%
Would take again
Discrete Mathematics for Computing II
CS 3305
Erik Jonsson School of Engineering and Computer Science
Advanced counting methods; recurrence relations, divide and conquer algorithms, principle of inclusion and exclusion. Partial orders and lattices, Algorithmic complexity. Graph theory. Strings and languages. Number theory. Elements of modern algebra. Credit cannot be received for both courses, CS 3305 and SE 3306. Double majors are required to take CS 3305. 3 credit hours.
Prerequisites: (CE 2305 or CS 2305) with a grade of C or better, and (MATH 2414 or MATH 2419).
Offering Frequency: Each semester
Grades: 6,541
Median GPA: B+
Mean GPA: 3.232
Click a checkbox to add something to compare.