CISC230 Data Structures & Algorithm Analysis

This course covers performance analysis and measurement of programs, formal induction proofs, asymptotic notation, algorithm analysis, hashing, binary trees, binary search trees, balanced search trees, graphs, biconnected components, spanning trees, and shortest path algorithms. Offered fall semester only.