This exploration of structured design and programming techniques blends theory with applications.

This is a revision of the authors 1982 volume into Pascal, the language most widely used for teaching data structures. Data structures are central to computer science, and in particular to programming. In the analytic areas, appropriate data structures have been the key to advances in the design of algorithms. Once appropriate data structures are carefully defined, all that remains is routine coding. A comprehensive understanding of data structure techniques is essential in the design of algorithms and programs. This text presents a carefully chosen fraction of available material, but supplement it with a wide variety of exercises. No single book can discuss all known data structures or algorithms. This text presents the art of designing data structures, preparing the student to devise special-purpose structures for specific problems as they present themselves.

Information and meaning; The stack; Recursion; Queues and list; Pascal list processing; Graphs and their applications; Sorting; Searching; Scalar types in Pascal; Using one-dimensional arrays; Packed arrays; Arrays parameters; Value and variable parameters; Records in Pascal; Arrays of records; Scope identifiers; The with statement; Efficiency of record access; Packed records; Files of records.