Analyis of complex data structures and algorithms used in systems programming, database design, and other applications. Topics include B-trees, Fibonacci heaps, graph representation, data structures, graph search algorithms, minimum spanning tree algorithms, shortest path algorithms, flow networks, techniques for correctness, proof, and worst case complexity analysis of algorithms. A computer use course.
Prerequisites: CST 280 (3).