An in-depth treatment of a variety of data structures and their associated algorithms. Stacks, queues, arrays and their address mapping functions. Linear lists, list operations, sequential and linked storage allocation, and garbage collection. Trees, binary trees, tree operations, and use of trees in sorting and searching. Multi-linked structures. Dynamic storage allocation; files and file structures; hash codes and comparison of search methods.
Syllabus and detailed description for Fall 2002
Assignments for Fall 2002