CISC230 Data Structures & Algorithm Analysis

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, shortest path algorithms. Prereq. - CISC125. Offered fall semester only.