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 301 or passing score on Examination in Programming Proficiency; MATH 270B; declared major/minor in CPSC, CPEN, or CPEI.