Résumé
This long-awaited second edition of Data Structures with
C++ Using STL, by Professors Ford and Topp, provides a
modern object-oriented approach to data structures using
the model of the Standard Template Library (STL). The
authors unify the study of data structures around the
concepts of containers and iterators. The book skillfully
develops algorithms for the data structures and their
applications. Readers will find a systematic and detailed
implementation for each data structure. These successful
authors offer a learning tool that is motivated by a wealth
of excellent examples and complete running programs.
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.
Key features
- Uses the early chapters to present object design and programming principles that are at the core
- of data structures.
- Develops clear and concise templates, which can support generic programming throughout the book.
- Uses the STL container classes throughout the book.
- Presents an Application Programming Interface (API) for each STL container and immediately uses it
- to solve problems.
- Demonstrates the implementation of the STL classes by developing mini-container classes that use
- the corresponding STL interface. The student can understand the overall design of the container
- and its C++ implementation code.
- Includes and intuitive and precise introduction to iterators that are at the core of modern data
- structures.
- Covers with the same careful style advanced topics such as red-black trees, hash tables, heaps,
- and graphs.
- Provides the reader with an extensive development of advanced recursion and inheritance as applied
- to data structures.
- Makes availablevaluable pedagogical features including chapter objectives and summaries; many
- complete programs with runtime output; case studies; review exercises with solutions for each
- chapter; extensive written and programming exercises; and a programming project for each chapter.
- Supplement: Instructor CD with solutions and a test item file; Companion Website containing
- language tutorials, students assessment materials, and PowerPoint slides.
(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.
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. StackImplementation. 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.
Caractéristiques techniques
| PAPIER | |
| Éditeur(s) | Prentice Hall |
| Auteur(s) | William Ford, William Topp |
| Parution | 01/10/2001 |
| Nb. de pages | 1038 |
| Format | 19,7 x 24,2 |
| Couverture | Relié |
| Poids | 1758g |
| Intérieur | Noir et Blanc |
| EAN13 | 9780130858504 |
| ISBN13 | 978-0-13-085850-4 |
Avantages Eyrolles.com
Livraison à partir de 0,01 € en France métropolitaine
Paiement en ligne SÉCURISÉ
Livraison dans le monde
Retour sous 15 jours
+ d'un million et demi de livres disponibles
Nos clients ont également acheté
Consultez aussi
- Les meilleures ventes en Graphisme & Photo
- Les meilleures ventes en Informatique
- Les meilleures ventes en Construction
- Les meilleures ventes en Entreprise & Droit
- Les meilleures ventes en Sciences
- Les meilleures ventes en Littérature
- Les meilleures ventes en Arts & Loisirs
- Les meilleures ventes en Vie pratique
- Les meilleures ventes en Voyage et Tourisme
- Les meilleures ventes en BD et Jeunesse
- Informatique Développement d'applications Technologies objet
- Informatique Développement d'applications Programmation graphique et multimédia Programmation graphique en C/C++
- Informatique Développement d'applications Langages C++
- Informatique Développement d'applications Outils de développement Borland C++ Builder
- Informatique Développement d'applications Outils de développement Visual C++
- Informatique Développement d'applications Outils de développement Visual C++ .NET
