Timothy Budd takes an exciting new approach to teaching data structures by incorporating the power of the Standard Template Library (STL). This book represents a reversal of the traditional presentation. Before concentrating on writing programs, Dr. Budd emphasizes how to use a standard abstraction. Working with this standard library, students will master the fundamentals of data structures and learn the power of C++, allowing them to carry their knowledge to later courses and into their careers. While the major topics have remained similar to the author's earlier book, Classic Data Structures in C++, the implementations have been completely revised. Since data structures are assumed to exist in the programming environment from the start, the presence of the STL permits reordering of topics within each chapter.
I. FUNDAMENTAL TOOLS
Classes and Object-Oriented Programming.
The Class Card.
The Class Deck.
The Class Player.
The Game Itself.
Making an Interactive Game.
Accessor and Mutator Functions.
Algorithms — Descriptions of Behavior.
Recipes as Algorithms.
Analyzing Computer Algorithms.
Analyzing Execution Time.
Algorithmic Execution Time of Programming Constructs.
Summing Algorithmic Execution Times.
Benchmarking Actual Execution Times.
Increasing Confidence in Correctness.
II. THE STANDARD CONTAINERS.
Selecting a Container.
The String Data Type.
Problem Solving with Strings.
The Implementation of Strings.
Vectors — A Random Access Data Structure.
Problem Solving with Vectors.
Summary of Vector Operations.
The Implementation of Vector.
Implementing Generic Algorithms.
Lists — A Dynamic Data Structure.
Summary of List Operations.
An Example Implementation.
Variation Through Inheritance.
Stacks and Queues.
Deques — Double Ended Data Structures.
Application - Depth and Breadth First Search.
Application - A Framework for Backtracking.
Set and Multisets.
Bit Vector Sets.
The Set Data Type.
Summary of Operations for Class Set.
An Implementation of Class Set.
Trees — A Nonlinear Data Structure.
Operator Precedence Parsing.
Binary Tree Representation of General Trees.
Balanced Binary Search Trees.
Finding the Nth Largest.
Application - Discrete Event-Driven Simulation.
Maps and Multimaps.
Operations on Maps.
An Example Implementation.
III. OTHER CONTAINERS.
Collision Resolution Using Buckets.
Hash Table Sorting Algorithms.
The Hash_Table Data Type.
Matrics — Two Dimensional Data Structures.
Matrices as Vectors of Vectors.
Non-Integer Index Values.
Adjacency Matrix Representation.
Edge List Representation.
Weighted Adjacency Matrix.
Sparse Matrix Representation.
Files — External Collections.
Character Stream Operations.
Application - Lexical Analysis.
Application - File Merge Sort.
IV. APPENDICES. 0201308797T04062001
For more information about any of the supplements listed below, use our Rep. Locator to contact your Addison Wesley representative.
- Free Copy / 0-201-31659-5