Units: 4.00
Algorithm design and analysis; techniques based on divide and conquer, branch and bound, dynamic programming, and the greedy approach; computer engineering applications such as circuit partitioning and logic circuit technology mapping; computational complexity and NP-completeness.
PREREQUISITE(S):
ELEC 278 or MREN 178, ELEC 270 or any discrete mathematics course
Exclusions:
CMPE 365