Return to search
Computer Science
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: Fall 2024 Spring 2025
Prerequisite: BSCS Majors and CS 249 with a grade of C or better
Computer Science
Term : Summer 2016
Catalog Year : 2015-2016
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: Fall 2024 Spring 2025
Prerequisite: BSCS Majors and CS 249 with a grade of C or better