|
Sep 07, 2024
|
|
|
|
CPSC 335 - Algorithm Engineering (3) Algorithm design using classical patterns: exhaustive search, divide and conquer, randomization, hashing, reduction, dynamic programming, and the greedy method. Asymptotic and experimental efficiency analysis. NP-completeness and decidability. Implementing algorithms to solve practical problems.
Prerequisites: CPSC 131, MATH 170A, MATH 150A; Computer Science or Computer Engineering major or minor; or Computer Science or Computer Engineering graduate standing.
Undergraduate Course not available for Graduate Credit
Add to Portfolio (opens a new window)
|
|