CS 141: INTERMEDIATE DATA STRUCTURES AND ALGORITHMS
University of California, Riverside
4 Units, Lecture, 3 hours; discussion, 1 hour. Prerequisite(s): CS 010C with a grade of C- or better; CS 111; MATH 009C or MATH 09HC; proficiency in C++. Explores basic algorithm analysis using asymptotic notations, summation and recurrence relations, and algorithms and data structures for discrete structures including trees, strings, and graphs. Also covers general algorithm design techniques including "divide-and-conquer," the greedy method, and dynamic programming. Integrates knowledge of data structures, algorithms, and programming.
Average GPA: 2.81
Grade distribution records: 4,233 students across 39 terms.
Grade distribution
| Grade | Students | Percent |
|---|---|---|
| A+ | 395 | 9.3% |
| A | 600 | 14.2% |
| A- | 434 | 10.3% |
| B+ | 376 | 8.9% |
| B | 531 | 12.5% |
| B- | 434 | 10.3% |
| C+ | 253 | 6.0% |
| C | 358 | 8.5% |
| C- | 231 | 5.5% |
| D+ | 69 | 1.6% |
| D | 146 | 3.4% |
| D- | 71 | 1.7% |
| F | 224 | 5.3% |
| NP | 11 | 0.3% |
| S | 49 | 1.2% |
| W | 48 | 1.1% |
Based on 4,233 student grade records across 39 terms and 10 professors.
Instructors
- Elena Strzheletska 617 students, Average GPA 2.52
- Amey Bhangale 436 students, Average GPA 2.80
- Ahmed Eldawy 398 students, Average GPA 2.99
- Yan Gu 371 students, Average GPA 2.88
- Yihan Sun 313 students, Average GPA 3.02
- Amr Ahmed 300 students, Average GPA 2.85
- Mingxun Wang 163 students, Average GPA 2.94
- Stefano Lonardi 119 students, Average GPA 2.30
- Silas Richelson 83 students, Average GPA 3.11
- Fuad Jamour 26 students, Average GPA 3.62