Course description

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. (Prereq: CST 238 AND MATH 170)

Units: 4

Spring 2019 sections

Section: 1
Number: 22038
Units: 4
Seats: 59/60
  • Tuesday, Thursday 2 – 3:50 pm
    Gambord - 110

CST 370: Design&Analysis ofAlgorithms

Class full Permission required
Section: 3
Number: 23712
Units: 4
Seats: 39/38
  • Tuesday, Thursday 4 – 5:50 pm
    Gambord - 117