Computer Science
CS 421 - Algorithms
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.
Units:
3
Sections offered:
Spring 2024
Fall 2024
Requirement Designation:
Prerequisite: BSCS Majors and CS 249 with a grade of C or better