CS 141

INTERMEDIATE DATA STRUCTURES AND ALGORITHMS

4credits
About this course

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.

All available terms

38 terms

Avg. GPA
2.79
Grades
4,149

Other grades

NP0.3%S1.2%W2.9%
More course details

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 distribution

GradeStudentsPercent
A+3869.3%
A54513.1%
A-41710.1%
B+3648.8%
B49011.8%
B-42410.2%
C+2586.2%
C3468.3%
C-2245.4%
D+781.9%
D1403.4%
D-801.9%
F2145.2%
NP110.3%
S491.2%
W1212.9%

Based on 4,149 student grade records across 38 terms and 12 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