To investigate the essential properties of data structures and algorithms for operating on them; to use these structures as tools to assist algorithm design; to extend exposure to searching, sorting and hashing techniques.
Linked lists, stacks, queues
Sequential search, binary search
Binary search trees, balanced binary search trees, hash tables
Heaps for priority queues
Graphs and graph algorithms
Asymptotic analysis of time and space requirements
Several problem sets and programs