This course discusses the implementation and use of common non-linear data structures, including random access files, sparse arrays, trees and graphs. Algorithms for accessing and updating structures are presented and analyzed. Topics covered include hashing, sorting and searching, and a selection of standard graph algorithms. This is a programming intensive course.