MATH 320 Advanced Data Structures and Algorithms
This course introduces advanced-level abstract data structures and algorithms. Concentration is centered on design, analysis, and implementation. Data structure topics include trees, priority queues, maps, hash tables, skip lists, and graphs. Algorithm design topics are selected from the following: tree traversals, binary search, merge sort, quick sort, selection, pattern-matching, dynamic programming, text compression, graph traversals, shortest paths, and minimum spanning trees. Students are taught how to analyze and classify the computational complexity of an algorithm, i.e., asymptotic analysis (big O notation).