Approximation Algorithms

CT Score

1500

#0 of 0 in COMPSCI

Difficulty

—/10

Workload

—h/wk

Median grade

—

from grade distribution

Would take again

—

n = 0 verified

Grade distribution

No distribution published for this course.

By professor: same course, different game

PROFESSORSCOREGRADEHRS/WKTERMS

Professor ratings →

Sections

No section data for this term yet.

In the tree

COMPSCI 161 (may be taken concurrently) with a minimum grade of B-. Required: A course on Linear Programming or working knowledge of LP-duality theory and working knowledge of complexity theory and NP-completeness→COMPSCI 287→unlocks 0 courses

No mapped courses require this one yet. See on the map →

Study groups

0 active

🔒 Verified-only writes. You post as “sophomore, lecture section”: real enough to trust, anonymous enough to be honest.