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.
38 terms
Other grades
University of California, Riverside
CS 141 at UCR: average GPA 2.79 across 4,149 students. Grade distribution by term. 4 Units, Lecture, 3 hours; discussion, 1 hour. Prerequisite(s): CS 010C with…
Average GPA: 2.79
Grade distribution records: 4,149 students across 38 terms.
| Grade | Students | Percent |
|---|---|---|
| A+ | 386 | 9.3% |
| A | 545 | 13.1% |
| A- | 417 | 10.1% |
| B+ | 364 | 8.8% |
| B | 490 | 11.8% |
| B- | 424 | 10.2% |
| C+ | 258 | 6.2% |
| C | 346 | 8.3% |
| C- | 224 | 5.4% |
| D+ | 78 | 1.9% |
| D | 140 | 3.4% |
| D- | 80 | 1.9% |
| F | 214 | 5.2% |
| NP | 11 | 0.3% |
| S | 49 | 1.2% |
| W | 121 | 2.9% |
Based on 4,149 student grade records across 38 terms and 12 professors.
Related topic in CS
Related topic in CS
Related topic in CS
Related topic in CS
Related topic in CS
Related topic in CS
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