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.
Units: 3
Sections offered: Spring 2026 Fall 2026
Prerequisite: CS 249 with a grade of C or better and (Computer Science BSCS, Informatics BS or Data Science BS)
Computer Science
Term : Fall 2026
Catalog Year : 2026-2027
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.
Units: 3
Sections offered: Spring 2026 Fall 2026
Prerequisite: CS 249 with a grade of C or better and (Computer Science BSCS, Informatics BS or Data Science BS)