Listed in: Computer Science, as COSC-301
Formerly listed as: COSC-21 | COSC-30 | COSC-31
This course continues the exploration of data structures and algorithms that is begun in COSC 201. Topics include balanced search trees, amortized algorithms, graph data structures and algorithms, greedy algorithms, dynamic programming algorithms, NP completeness, and case studies in algorithm design.
Requisite: COSC 112 and 201. Fall semester. Professor L. McGeoch.