Course Prefix:CSECourse #: 531Keywords:showing 0 to 1
CSE 531LEC Analysis of Algorithms I
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.
3 Grading: Graded (GRD) Typically Offered:Varies