Research work · 1988

Abstract data types: their specification, representation, and use

Peter Thomas, Hugh Robinson, Judy M. Emms

Clarendon Press eBooks

Abstract

Part 1 Abstract data types and software engineering: introduction specification. Part 2 Formal specification of abstract data types: introduction syntax and semantics defining syntax defining semantics axiomatically defining semantics constructively. Part 3 Representation and implementation of abstract data types: introduction a cursor-based implementation of a stack in PASCAL a pointer-based implementation of a stack in PASCAL information hiding implementing a stack in UCSD PASCAL constraint handling summary of chapter. Part 4 Encapsulation in high level languages: introduction information hiding in Ada information hiding in MODULA-2 exception handling summary of chapter. Part 5 The abstract data type queue: introduction the specification of the abstract data type queue a linked representation a pointer-based implementation in UCSD PASCAL a cursor-based representation implementation in UCSD PASCAL summary of chapter. Part 6 The abstract data type deque: introduction the specification of the abstract data type deque a linked representation a pointer-based implementation. Part 7 Binary search trees: trees, binary trees and binary search trees the specification of the binary tree the specification of the binary search tree tree traversals implementation of the binary search tree summary of chapter. Part 8 Case studies: case study 1 - a directory case study 2 - a file editor case study 3 - a database application. Part 9 Object-oriented program design: introduction example - maintaining a bank account implementation review object-oriented programming languages. References and bibliography. Solutions to exercises. Index.