Abstract data types : specifications, implementations, and applications /
Nell Dale, Henry M. Walker.
- Lexington ; Toronto : D. C. Heath and Company, 1996.
- xxiii, 624, A1-A98 p. : ill. b&w ; 24 cm.
Includes bibliographical references and index.
Ch. 1. Abstract specification techniques -- Ch. 2. Analysis of algorithms -- Ch. 3. Toward more generality in algorithm -- Ch. 4. Unstructured data types -- Ch. 5. Semi-structure data types -- Ch. 6. Structure linear data types -- Ch. 7. Binary trees -- Ch. 8. Binary search trees -- Ch. 9. Multi-way search trees -- Ch. 10. Directed graphs or digraphs -- Ch. 11. Undirected graphs and complexity -- Ch. 12. Generalized lists -- Ch. 13. Memory management.
This text expands the traditional course focus to examine not only the structure of a data object, but also its type. This broader focus requires a new paradigm for classifying data types. Within each classification, the different ADTs are presented using axiomatic specifications. Various implementation alternatives are discussed for each ADT and algorithms are written in a pseudo-code based on the Pascal-Modula- 2-Ada model. Next, the Big-O complexity of each implementation is discussed and each ADT is used in an application. Classic algorithms provide applications for some of the ADTs; implementation of a previously defined ADT is the application for others. The result is a clear, logical presentation that gives students a solid, practical foundation in current software engineering principles. Applications are included to demonstrate how the ADTs are used in problem-solving. Proven pedagogical features such as detailed examples, highlighted definitions, numerous illustrations, and exercises teach problem-solving skills.
9780669400007
Abstract data types (Computer science) Data structures (Computer science)