CS 111: DISCRETE STRUCTURES
University of California, Riverside
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.
Average GPA: 2.40
Grade distribution records: 5,037 students across 39 terms.
Grade distribution
| Grade | Students | Percent |
|---|---|---|
| A+ | 252 | 5.0% |
| A | 468 | 9.3% |
| A- | 300 | 6.0% |
| B+ | 419 | 8.3% |
| B | 609 | 12.1% |
| B- | 460 | 9.1% |
| C+ | 483 | 9.6% |
| C | 463 | 9.2% |
| C- | 278 | 5.5% |
| D+ | 220 | 4.4% |
| D | 201 | 4.0% |
| D- | 145 | 2.9% |
| F | 520 | 10.3% |
| NP | 36 | 0.7% |
| S | 49 | 1.0% |
| W | 133 | 2.6% |
Based on 5,037 student grade records across 39 terms and 5 professors.
Instructors
- Elena Strzheletska 2,580 students, Average GPA 2.43
- Marek Chrobak 484 students, Average GPA 2.42
- Miguel Gutierrez-Pasillas 177 students, Average GPA 2.65
- Huong Luu 26 students, Average GPA 2.84
- Amey Bhangale 20 students, Average GPA 2.33