DATA 371 - Data Structures and Algorithms II

3 credit hours - Continuation of Part I. Emphasis on graph and string processing. Topics include graph representation, breadth-first and depth-first search, minimum spanning trees (Prim, Kruskal), shortest paths (Dijkstra, Bellman-Ford), substring search, regular expressions, and data compression. Other topics include event-driven simulation, B-trees, maximum flow, and an introduction to intractability.

Prerequisite(s): DATA 171 , DATA 245 , DATA 246 and DATA 370 .