Grades:
Median GPA:
Mean GPA:
Click a checkbox to add something to compare.
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+ | ||
UTD TRENDSGrades:
Median GPA:
Mean GPA:
Click a checkbox to add something to compare.
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+ | ||
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,028
Median GPA: B+
Mean GPA: 2.963
Click a checkbox to add something to compare.
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,028
Median GPA: B+
Mean GPA: 2.963
Click a checkbox to add something to compare.
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+ | ||