CS 145

COMBINATORIAL OPTIMIZATION ALGORITHMS

4credits
About this course

4 Units, Lecture, 3 hours; discussion, 1 hour. Prerequisite(s): CS 141; MATH 031 or MATH 131. The study of efficient algorithm design techniques for combinatorial optimization problems. Topics include shortest paths, minimum spanning trees, network flows, maximum matchings, stable matchings, linear programming, duality, two-person games, algorithmic techniques for integer programming problems, NP-completeness, and approximation algorithms.

All available terms

9 terms

Avg. GPA
3.31
Grades
243

Other grades

S0.4%W3.3%
More course details

University of California, Riverside

CS 145 at UCR: average GPA 3.31 across 243 students. Grade distribution by term. 4 Units, Lecture, 3 hours; discussion, 1 hour. Prerequisite(s): CS 141; MATH…

Average GPA: 3.31

Grade distribution records: 243 students across 9 terms.

Grade distribution

GradeStudentsPercent
A+20.8%
A3514.4%
A-7028.8%
B+4618.9%
B4217.3%
B-239.5%
C+52.1%
C72.9%
D10.4%
F31.2%
S10.4%
W83.3%

Based on 243 student grade records across 9 terms and 2 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