Description: Order notation; design techniques such as divide and conquer, greedy, and dynamic programming; advanced data structures; and time- and space-complexity analysis. Introduces NP completeness. Letter grade only. Course fee required.
Sections offered: Spring 2019
Prerequisite: BSCS Majors and CS 249 with a grade of C or better