|
Nov 23, 2024
|
|
|
|
CPSC 335 - Algorithm Engineering (3) Prerequisites: Examination in Programming Proficiency, MATH 270B , MATH 338 . Algorithm design using classical paradigms: exhaustive search, divide and conquer, reduction, dynamic programming and the greedy method. Asymptotic and experimental efficiency analysis. Problem hardness: lower bound, NP-completeness and decidability. Methods for circumventing hardness. Implementing algorithms to solve practical problems.
Add to Portfolio (opens a new window)
|
|