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.
Ph.D.:
This course fulfills one CSE General Program Core Course requirement.
M.S.:
This course fulfills one Theory/Algorithms Core Course requirement.
Data Structures (CSE250), Calculus II, and a course that requires formal proofs.