|
Sep 07, 2024
|
|
|
|
CS 351 - Algorithms Min Units: 3 Max Units: 3 A systematic study of data structures and algorithms with an introduction to theoretical computer science. Topics include greedy algorithms, divide-and-conquer, dynamic programming, backtracking, branch and bound, searching and sorting algorithms, mathematical algorithms, time and space complexity, and an introduction to the theory of NP-completeness. (U) Fall, Spring Prerequisite(s): CS 341
Add to Favorites (opens a new window)
|
|