Aug 01, 2021  
2020-2021 University Catalog 
    
2020-2021 University Catalog [ARCHIVED CATALOG]

Add to Portfolio (opens a new window)

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: MATH 270B , CPSC 131 ; 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)