Your textbook…
Data Structures with C++ Using STL, 2nd Edition
ISBN-10: 0-13-085850-1
ISBN-13: 978-0-13-085850-4
Published by Prentice Hall
© 2002
Pub. Date: Jul 17, 2001
Format: Paper
Table of Contents
(Most chapters end with Chapter Summary, Classes and Libraries in the Chapter, Review Exercises, Written Exercises, Programming Exercises and Programming Projects.)
Preface.
1. Introduction to Data Structures.
2. Object Design Techniques.
3. Introduction to Algorithms.
4. The Vector Container.
5. Pointers and Dynamic Memory.
6. The List Container and Iterators.
7. Stacks.
8. Queues and Priority Queues.
9. Linked Lists.
10.Binary Trees.
11. Associative Containers.
12. Advanced Associative Structures.
13. Inheritance and Abstract Classes.
14. Heaps Binary Files and Bit Sets.
15. Recursive Algorithms.
16. Graphs.
Index.
Preface.
1. Introduction to Data Structures.
What is this Book About? Abstract View of Data Structures. An ADT as a Class. Implementing C++ Classes. Declaring and Using Objects. Implementing a Class with Inline Code. Application Programming Interface(API). Strings.
2. Object Design Techniques.
Software Design. Handling Runtime Errors. Object Composition. Operator Overloading.
3. Introduction to Algorithms.
Selection Sort. Simple Search Algorithms. Analysis of Algorithms. Analyzing the Search Algorithms. Making Algorithms Generic. The Concept of Recursion. Problem Solving with Recursion.
4. The Vector Container.
Overview of STL Container Classes. Template Classes. The Vector Class. Vector Applications.
5. Pointers and Dynamic Memory.
C++ Pointers. Dynamic Memory. Classes Using Dynamic Memory. Assignment and Initialization. The Minivector Class. The Matrix Class.
6. The List Container and Iterators.
The List Container. Iterators. General List Insert And Erase Operations. Case Study: Graduation Lists.
7. Stacks.
The Stack ADT. Recursive Code and the Runtime Stack. Stack Implementation. Postfix Expressions. Case Study: Infix Expression Evaluation.
8. Queues and Priority Queues.
The Queue ADT. The Radix Sort. Implementing the Miniqueue Class. Case Study: Time-Driven Simulation. Array Based Queue Implementation. Priority Queues.
9. Linked Lists.
Linked List Nodes. Building Linked Lists. Handling The Back of the List. Implementing a Linked Queue. Doubly Linked Lists. Updating A Doubly Linked List. The Josephus Problem. The Minilist Class. Selecting a Sequence Container.
10.Binary Trees.
Tree Structures. Binary Tree Nodes. Binary Tree Scan Algorithms. Using Tree Scan Algorithms. Binary Search Trees. Using Binary Search Trees. Implementing the Stree Class. The Stree Iterator (Optional).
11. Associative Containers.
Overview of Associative Containers. Sets. Maps. Multisets. Implementing Sets And Maps.
12. Advanced Associative Structures.
Hashing. Designing Hash Functions. Designing Hash Tables. The Hash Class. Hash Table Performance. 2-3-4 Trees. Red-Black Trees. The Rbtree Class.
13. Inheritance and Abstract Classes.
Inheritance in C++. The Graphics Hierarchy. The Graphics System. Safe Vectors. Ordered Lists. Polymorphism and Virtual Functions. Abstract Classes.
14. Heaps Binary Files and Bit Sets.
Array Based Binary Trees. Heaps. Implementing a Priority Queue. Binary Files. Bitsets. Case Study: Huffman Compression.
15. Recursive Algorithms.
Divide and Conquer Algorithms. Combinatorics. Dynamic Programming. Backtracking: The Eight-Queens Problem.
16. Graphs.
Graph Terminology. The Graph Class. Graph Class Design. Graph Traversal Algorithms. Graph Traversal Applications. Graph Minimization Algorithms.
Index.
This textbook is also sold in the various packages listed below. Before purchasing one of these packages, speak with your professor about which one will help you be successful in your course.
Package ISBN-13: 9780135121702
$317.80 | Add to Cart
This package contains:
- Data Structures with C++ Using STL, 2nd Edition
William H. Ford, William R. Topp | ©2002 | Paper; 1039 pages - Introduction to the Design and Analysis of Algorithms, 2nd Edition
Anany V. Levitin | ©2007 | Paper; 592 pages - Problem Solving, Abstraction & Design Using C++, 5th Edition
Frank L. Friedman, Elliot B. Koffman | ©2007 | Paper; 600 pages
