Download Free Data Structures With Abstract Data Types And Modula 2 Book in PDF and EPUB Free Download. You can read online Data Structures With Abstract Data Types And Modula 2 and write the review.

Contains explanations of what abstract data types are and how to specify them, and of the connection between abstract data types and program components. The book does assume a knowledge of Modula-2, although some of the difficulties of using opaque types are discussed before they are used.
Since 1985 Nell Dale's texts have helped shape the way computer science is taught. Now she and Henry Walker, an accomplished instructor and author in his own right, are proposing a new focus for the junior/senior level data structures course. A timely response to the prevalence of object-oriented programming, this new text expands the focus of the advanced data structures course to examine not only the structure of a data object but also its type. This new focus gives students the opportunity to look at data objects from the point of view of both user and implementer.
Intended as a second course on programming with data structures, this book is based on the notion of an abstract data type which is defined as an abstract mathematical model with a defined set of operations.
A formal, accessible approach to abstract data types, employing the Modula-2 computer language. Chapters follow a common format--the need for a particular abstract data type is considered, followed by the type's properties, the access procedure to manipulate it, the axioms which govern its behavior, and implementations. A wide variety of abstract data types are covered, supported by numerous Modula-2 algorithms. Code is written in a functional, recursive style.
"All aspects pertaining to algorithm design and algorithm analysis have been discussed over the chapters in this book-- Design and Analysis of Algorithms"--Resource description page.
This student text explores large-scale program design in the object-oriented paradigm, with an emphasis on data abstraction. It assumes knowledge of an imperative language such as PASCAL and provides examples in C++ and ADA.