Learn about formal specifications of abstract data types and their data structure representations, operations, and algorithms. Explore priority queues, dictionaries, graphs, heaps, hash tables, binary search trees, balanced trees,and graph adjacency representations. Examine sorting, searching, dynamic storage handling, and fundamental graph algorithms. Learn about asymptotic analysis of time and space complexity and use it throughout the course. Implement a variety of data structures and graph algorithms.