Linear programming: simplex and revised simplex method, duality theory, primal-dual algorithms, Karmarkar's algorithm. Network flow problems: max-flow/min-cut theorem, Ford-Fulkerson algorithm, shortest path algorithms. Complexity and NP-completeness theory: the classes of P and NP,reductions between np-complete problems, pseudopolynomial and approximationalgorithms.
9 terms
University of California, Santa Barbara
ECE 271A at UCSB: average GPA 3.89 across 122 students. Grade distribution by term. Linear programming: simplex and revised simplex method, duality theory…
Average GPA: 3.89
Grade distribution records: 122 students across 9 terms.
| Grade | Students | Percent |
|---|---|---|
| A | 103 | 84.4% |
| A- | 12 | 9.8% |
| B+ | 2 | 1.6% |
| B | 3 | 2.5% |
| B- | 1 | 0.8% |
| F | 1 | 0.8% |
Based on 122 student grade records across 9 terms and 1 professor.
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