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 with a C- or better)

Units: 4

Fall 2019 sections

Section: 1
Number: 42467
Units: 4
Seats: 45/60
  • Monday, Wednesday 4 – 5:50 pm
    Gambord - 110
Instructor: