Data Structures in C++ : Using the Standard Template Library (STL) (Hardcover)
Timothy Budd
- 出版商: Addison Wesley
- 出版日期: 1997-08-30
- 售價: $1,100
- 貴賓價: 9.5 折 $1,045
- 語言: 英文
- 頁數: 576
- 裝訂: Hardcover
- ISBN: 0201308797
- ISBN-13: 9780201308792
-
相關分類:
C++ 程式語言、Algorithms-data-structures 資料結構與演算法
立即出貨 (庫存=1)
買這商品的人也買了...
-
$680$578 -
$690$587 -
$890$703 -
$150$128 -
$650$553 -
$580$493 -
$780$741 -
$950$751 -
$750$593 -
$800$680 -
$550$523 -
$680$612 -
$620$490 -
$990$891 -
$290$226 -
$600$480 -
$580$493 -
$690$545 -
$780$616 -
$580$458 -
$650$514 -
$480$432 -
$480$408 -
$720$612 -
$320$250
相關主題
商品描述
Description
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.
Table Of Contents
I. FUNDAMENTAL TOOLS
Language Fundamentals.
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.
Recursive Algorithms.
Analyzing Execution Time.
Algorithmic Execution Time of Programming Constructs.
Summing Algorithmic Execution Times.
Benchmarking Actual Execution Times.
Increasing Confidence in Correctness.
Program Testing.
II. THE STANDARD CONTAINERS.
Selecting a Container.
Iterators.
The String Data Type.
Problem Solving with Strings.
String Operations.
The Implementation of Strings.
Vectors — A Random Access Data Structure.
Templates.
Problem Solving with Vectors.
Summary of Vector Operations.
The Implementation of Vector.
Implementing Generic Algorithms.
Lists — A Dynamic Data Structure.
Summary of List Operations.
Example Programs.
An Example Implementation.
Variation Through Inheritance.
Stacks and Queues.
Adapters.
Stacks.
Queues.
Deques — Double Ended Data Structures.
Application - Depth and Breadth First Search.
Application - A Framework for Backtracking.
An Implementation.
Set and Multisets.
Set Operations.
Bit Vector Sets.
The Set Data Type.
Summary of Operations for Class Set.
An Implementation of Class Set.
Trees — A Nonlinear Data Structure.
Binary Trees.
Operator Precedence Parsing.
Tree Traversals.
Binary Tree Representation of General Trees.
Searching.
Ordered Vectors.
Balanced Binary Search Trees.
Finding the Nth Largest.
Priority Queues.
Heaps.
Skew Heaps.
Application - Discrete Event-Driven Simulation.
Maps and Multimaps.
Example Programs.
Operations on Maps.
An Example Implementation.
III. OTHER CONTAINERS.
Hash Functions.
Collision Resolution Using Buckets.
Hash Table Sorting Algorithms.
The Hash_Table Data Type.
Hash Functions.
Matrics — Two Dimensional Data Structures.
Matrices as Vectors of Vectors.
Sparse Matrices.
Non-Integer Index Values.
Graphs.
Adjacency Matrix Representation.
Edge List Representation.
Weighted Adjacency Matrix.
Sparse Matrix Representation.
Finite Automata.
Turing Machines.
Files — External Collections.
Character Stream Operations.
Application - Lexical Analysis.
Application - File Merge Sort.
Binary Files.
IV. APPENDICES. 0201308797T04062001

Supplements
Instructor Supplements
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
