Abstract Data Types and AlgorithmsSpringer, 1990 M11 30 - 377 pages 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. |
Contents
| 2 | |
Abstract Data Types and Program Design | 25 |
Elementary Linear ADTs | 48 |
Nonlinear ADTS Trees | 91 |
Abstract Data Type Sets I | 136 |
Abstract Data Type Sets II | 152 |
NonLinear ADTs Graphs | 200 |
Algorithm Design with Abstract Data Types | 231 |
Common terms and phrases
abstract data type Addison-Wesley adjacent arcs array assignment assume AVL trees b_search B-tree begin binary search tree binary tree boolean chapter characters complexity component construct Cset cycle data structures defined delete Dijkstra's algorithm divide and conquer dynamic programming ebuf efficient elements elems empty end end equal evaluate example exercise expression false Figure frontier function returns graph G hash table hashing function heapsort identifier implementation in-order input insertion sort instance integer linear loop mapping matching matrix maximum MCST merge sort modules NP-complete O(log O(n log O(n² operations PAIR_SET pairs Pascal pattern pointer polynomial pop(S position priority queue priority_queue problem quicksort recursive represented Reverse Polish right subtree sequence shortest solution sorting algorithms split stack storage stored string sub-lists sub-problems symbol techniques temp top(S traversal type elemtype V₁ variable weighted path length