Data structures using Modula--2
著者
書誌事項
Data structures using Modula--2
Wiley, 1985
大学図書館所蔵 件 / 全12件
-
該当する所蔵館はありません
- すべての絞り込み条件を解除する
内容説明・目次
内容説明
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.
目次
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.
「Nielsen BookData」 より
