Synopses & Reviews
'In this eagerly anticipated revision,
Clifford A. Shaffer provides a thorough and comprehensive treatment of fundamental data structures and the principles of algorithm analysis. The author focuses on teaching students and practitioners how to create
efficient data structures and algorithms and to understand the principles required to select or design the data structure that will best solve the problem. The integrated treatment of algorithm analysis, file processing, and efficiency places this book in a class of its own.
Features:
- Algorithm analysis techniques are presented throughout the text. Analysis is closely tied to the needs of practicing programmers and students. It is not presented as theory for theory\'s sake.
- Coverage of basic file processing techniques as an integral component of efficient data structures and algorithm analysis.
- C++ is used as a tool to illustrate data structure concepts with clear, simple-to-understand examples. All programming examples are actual C++ code.
- This book presents each data structure and algorithm as having costs and benefits, and provides the reader with a thorough understanding of how to assess the costs and benefits, including space comparisons for data structures, space/time trade-offs, and special-purpose uses of data structures or algorithms.
New to this Edition:
- Completely rewritten coding examples that are clear and illustrative. Extensive use of object-oriented programming techniques.
- Expanded coverage of recursion, Dictionary ADT, balanced tress, and buffer pools.
- More emphasis on techniques for object-oriented program design.
- More exercises and examples. Close to 350 problems and projects.
'
Synopsis
Second edition.
Synopsis
In this eagerly anticipated revision,
Clifford A. Shaffer provides a thorough and comprehensive treatment of fundamental data structures and the principles of algorithm analysis. The author focuses on teaching students and practitioners how to create
efficient data structures and algorithms and to understand the principles required to select or design the data structure that will best solve the problem. The integrated treatment of algorithm analysis, file processing, and efficiency places this book in a class of its own.
Features:
- Algorithm analysis techniques are presented throughout the text. Analysis is closely tied to the needs of practicing programmers and students. It is not presented as theory for theory's sake.
- Coverage of basic file processing techniques as an integral component of efficient data structures and algorithm analysis.
- C++ is used as a tool to illustrate data structure concepts with clear, simple-to-understand examples. All programming examples are actual C++ code.
- This book presents each data structure and algorithm as having costs and benefits, and provides the reader with a thorough understanding of how to assess the costs and benefits, including space comparisons for data structures, space/time trade-offs, and special-purpose uses of data structures or algorithms.
New to this Edition:
- Completely rewritten coding examples that are clear and illustrative. Extensive use of object-oriented programming techniques.
- Expanded coverage of recursion, Dictionary ADT, balanced tress, and buffer pools.
- More emphasis on techniques for object-oriented program design.
- More exercises and examples. Close to 350 problems and projects.
Synopsis
This practical text contains fairly “traditional” coverage of data structures with a clear and complete use of algorithm analysis, and some emphasis on file processing techniques as relevant to modern programmers. It fully integrates OO programming with these topics, as part of the detailed presentation of OO programming itself. Chapter topics include lists, stacks, and queues; binary and general trees; graphs; file processing and external sorting; searching; indexing; and limits to computation. For programmers who need a good reference on data structures.
Description
Includes bibliographical references (p. 497-501) and index.
Table of Contents
(NOTE:
Each chapter concludes with Further Readings, Exercises, and/or Projects.)
I. PRELIMINARIES. 1. Data Structures and Algorithms.
A Philosophy of Data Structures. Abstract Data Types and Data Structures. Problems, Algorithms, and Programs. 2. Mathematical Preliminaries.
Sets and Relations. Miscellaneous Notation. Logarithms. Recursion. Summations and Recurrences. Mathematical Proof Techniques. Estimating. 3. Algorithm Analysis.
Introduction. Best, Worst, and Average Cases. A Faster Computer, or a Faster Algorithm? Asymptotic Analysis. Calculating the Running Time of a Program. Analyzing Problems. Common Misunderstandings. Multiple Parameters. Space Bounds. Some Practical Considerations.
II. FUNDAMENTAL DATA STRUCTURES. 4. Lists, Stacks, and Queues.
Lists. The Dictionary ADT. Stacks. Queues. 5. Binary Trees.
Definitions and Properties. Binary Tree Traversals. Binary Tree Node Implementations. Binary Search Trees. Heaps and Priority Queues. Huffman Coding Trees. 6. Non-Binary Trees.
General Tree Definitions and Terminology. The Parent Pointer Implementation. General Tree Implementations. K -ary Trees. Sequential Tree Implementations.
III. SORTING AND SEARCHING. 7. Internal Sorting.
Sorting Terminology and Notation. Three …Q(n^{2}) Sorting Algorithms. Shellsort. Quicksort. Mergesort. Heapsort. Binsort and Radix Sort. An Empirical Comparison of Sorting Algorithms. Lower Bounds for Sorting. 8. File Processing and External Sorting.
Primary versus Secondary Storage. Disk Drives. Buffers and Buffer Pools. The Programmer's View of Files. External Sorting. Simple Approaches to External Sorting. Replacement Selection. Multiway Merging. 9. Searching.
Searching Sorted Arrays. Self-Organizing Lists. Searching in Sets. Hashing. 10. Indexing.
Linear Indexing. ISAM. Tree Indexing. 2-3 Trees. B-Trees.
IV. APPLICATIONS AND ADVANCED TOPICS. 11. Graphs.
Terminology and Representations. Graph Implementations. Graph Traversals. Shortest-Paths Problems. Minimum-Cost Spanning Trees. 12. Lists and Arrays Revisited.
Skip Lists. Multilists. Matrix Representations. Memory Management. 13. Advanced Tree Structures.
Tries. Balanced Trees. Spatial Data Structures. 14. Analysis Techniques.
Summation Techniques. Recurrence Relations. Amortized Analysis. 15. Limits to Computation.
Reductions. Hard Problems. Impossible Problems.
V. APPENDIX. Utility Functions.
Bibliography.
Index.