Synopses & Reviews
This intermediate-level treatment surveys data structures used in programming, concepts of programming in Modula-2, and algorithms useful for manipulating data structures. Emphasizes programming style and offers a wealth of examples, including complete, real-world programs. Approach to developing algorithms is very clear, making it easy to apply the principles of good programming. Chapters cover elementary Modula-2, essential language features, fundamental abstract data types, linked lists, binary trees, sorting algorithms, applications, and additional data structures. Each chapter contains a review section, practice test, and programming problems.
Table of Contents
Elementary Modula-2.
Abstract Data Types.
Fundamental Data Structures with Array Implementations.
Linked List Implementations of Fundamental Data Structures.
Trees.
Sorting Algorithms.
Larger Applications.
Additional Data Structures.
Answers to Selected Exercises.
Bibliography.
Subject Index.