CECS 328 - Algorithms

(3 units)

Prerequisite: CECS 228 and (CECS 274 or CECS 275), all with a grade of “C” or better.
Greedy algorithms, dynamic programming, divide and conquer, network flow, approximation algorithms, NP-complete problems. Programming projects to exemplify these concepts.

Letter grade only (A-F). (Lecture-problems 3 hours) Same course as CECS 328H. Not open for credit to students with credit in CECS 328H.