| |
Dec 21, 2024
|
|
|
|
|
Catalog 2019-2020 [ARCHIVED CATALOG]
|
CST 370 - Design and Analysis of Algorithms
Students learn important data structures in computer science and acquire fundamental algorithm design techniques to get the efficient solutions to several computing problems from various disciplines. Topics include the analysis of algorithm efficiency, hash, heap, graph, tree, sorting and searching, brute force, divide-and-conquer, decrease-and-conquer, transform-and-conquer, dynamic programming, and greedy programming.
Prerequisite(s)/Corequisite(s): (Prereq: CST 238 and MATH 170 with a C- or better)
Typically Offered: Fall, Spring
Units: 4
|
|
