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.

Prerequisites: ECE 210A (may be taken concurrently).

4

Units

Letter

Grading

1, 2, 3

Passtime

None

Level Limit

Engineering

College
These majors only ece
T B A
No info found
Spring 2024 . Mostofi Y C
PHELP2514
M W
12:00 PM - 13:50 PM
Winter 2025 . Mostofi Y C Torun M
ILP 4107
M W
12:00 PM - 13:50 PM
See All
ECE 271A Mostofi Y C Winter 2025 Total: 19
ECE 271A Mostofi Y C Spring 2024 Total: 11
ECE 256C
0 / 25 Enrolled
Advanced VLSI Architecture and Design
T B A
M W
14:00 PM - 15:15 PM
ECE 271C
0 / 25 Enrolled
Optimal Control of Dynamic Systems
T B A
T R
14:00 PM - 15:50 PM
ECE 277
0 / 50 Enrolled
Pattern Recognition
T B A
M W
12:00 PM - 13:50 PM
ECE 278A
0 / 60 Enrolled
Digital Image Processing
T B A
T R
16:00 PM - 17:50 PM
ECE 283
0 / 30 Enrolled
MACHINE LEARNING: A SIGNAL PROCESSING PERSPECTIVE
T B A
T R
12:00 PM - 13:50 PM
ECE 289
0 / 20 Enrolled
INTRODUCTION TO ROBOTICS: DYNAMICS AND CONTROL
Katie Byl 3.4
M W
14:00 PM - 15:15 PM