Abstract Data Types: Their Specification, Representation, and Use
Clarendon Press, 1988 - Abstract data types (Computer science) - 256 pages
This volume introduces abstract data types and their use in software engineering. Designed for self-study, the text offers over 100 exercises with fully worked solutions, and check point questions at critical places for monitoring progress. The authors, who base the text on their course at Open University (U.K.), lead students through designing, constructing, and implementing abstract data types using a number of simple but crucial concepts of software engineering such as stack, queue, and binary search trees. Two specification methods are studied: the axiomatic approach and the constructive approach. Illustrative examples throughout use Modula-2 and Ada, and three case studies are considered in detail.
16 pages matching EmployeeStack in this book
Results 1-3 of 16
What people are saying - Write a review
We haven't found any reviews in the usual places.
Formal specification of abstract data types
Representation and implementation of abstract data types
Encapsulation in high level languages
7 other sections not shown
abstract data type addtoqueue Amountl application program array axiom axiomatic approach begin binary search tree binary tree Boolean BSTree Chapter circular structure concatenate constraint violations createlist createqueue createtree current balance current record CurrentName Cursor data and returns data structure declaration defined definition module delete deletefromqueue deque dummy employee name EmployeeStack empty stack end end end record example exception handling Exercise formal language formal specification function IsEmptyStack implementation module information hiding inorder insert integer interface IsEmptyQueue isin left subtree Link maketree MaxSize message values MODULA-2 Moscow MoveCursor NameStack non-empty NumberStack object package body package specification parameter Pascal unit pointer procedure CreateStack procedure Pop procedure Push Item programming language queue representation result right subtree root node routines S.Top schema semantics sequence source tree stack is empty subprogram syntax definition Temp tree traversal type ItemType type Stack UCSD Pascal underlying model variables WriteLn WriteString