Data structures using Modula--2
Author(s)
Bibliographic Information
Data structures using Modula--2
Wiley, 1985
Available at / 11 libraries
-
No Libraries matched.
- Remove all filters.
Description and Table of Contents
Description
Offering a modern treatment of data structures featuring the use of abstract data types and generics, this book, designed for graduate/undergraduate courses in data structures and/or advanced programming, introduces data structure concepts before their implementation, and details the salient differences between Pascal and Modula-2. Advanced topics include virtual hashing, balanced trees and B trees.
Table of Contents
Abstraction and Problem Solving. The Stack and Queue Abstractions and Some Implementations. Applications of Stack and Queue Abstractions in Modula-2. The List (Search Table) Abstraction and Some Implementations. Applications of List Abstraction in Modula-2. Review of Recursion. The Tree and Some Implementations. Some Miscellaneous Applications of Trees in Modula-2. The Search Table Implemented with Binary Trees in Modula-2. The Search Table Implemented Using Hash Tables. Applications of Data Structures to Sorting. Memory Management. Appendixes. Index.
by "Nielsen BookData"