CS 111

DISCRETE STRUCTURES

4credits
About this course

4 Units, Lecture, 3 hours; discussion, 1 hour. Prerequisite(s): CS 011 or MATH 011; MATH 009C or MATH 09HC; MATH 031 or EE 020B, CS 009A with a grade of C- or better or CS 010A with a grade of C- or better. A study of discrete mathematical structures emphasizing applications to computer science. Topics include number theory and cryptography, asymptotic notation, recurrence equations, counting methods, elements of graph theory, and trees.

All available terms

38 terms

Avg. GPA
2.38
Grades
4,962

Other grades

NP0.7%S1.0%W5.6%
More course details

University of California, Riverside

CS 111 at UCR: average GPA 2.38 across 4,962 students. Grade distribution by term. 4 Units, Lecture, 3 hours; discussion, 1 hour. Prerequisite(s): CS 011 or…

Average GPA: 2.38

Grade distribution records: 4,962 students across 38 terms.

Grade distribution

GradeStudentsPercent
A+2254.5%
A4348.7%
A-2865.8%
B+3998.0%
B59111.9%
B-4298.6%
C+4829.7%
C4499.0%
C-2625.3%
D+2074.2%
D1923.9%
D-1372.8%
F50510.2%
NP360.7%
S491.0%
W2785.6%

Based on 4,962 student grade records across 38 terms and 8 professors.

Instructors

Related courses

The course page is taking longer to load. This summary is still available.

We could not load the full course details. This summary is still available.

Still loading. This can take a moment on a slow connection.

Loading My Class Grades