This page refers to the Spring 2017 offering of CSE 531 only. The information on this page does not necessarily apply to every offering of CSE 531.
Analysis of Algorithms
The design and analysis of algorithms. Time and space complexity of algorithms. Big-O notation. Analysis of recursive procedures. Algorithms for solving problems from graph theory, computational geometry. NP-completeness. Approximation algorithms. Parallel algorithms, etc.
None presently available.
Data Structures (CSE250), Calculus II, and a course that requires formal proofs.
Ph.D.: This course fulfills one CSE General Program Core Course (Breadth) requirement.
M.S.: This course fulfills one Theory/Algorithms Core Course (Breadth) requirement.