(3 cr) The topics of this course include basic tools for algorithm analysis including asymptotic notations, lower and upper bounds, and recursive relations; advanced data structures; analysis of recursive algorithms; analysis of algorithms for searching and sorting; analysis of graph and geometric algorithms; analysis of numerical algorithms; study of NP-complete problems; and study of parallel algorithms. Prerequisites: MATH 208, MATH 307, and CIS 321.
Add to Portfolio (opens a new window)
