Data Structures with C++ Using STL, 2/e
暫譯: 使用 STL 的 C++ 資料結構（第二版）

William H. Ford, William R. Topp

Data Structures with C++ Using STL, 2/e

買這商品的人也買了...

相關主題

商品描述

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.

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 available valuable 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.

Table of Contents


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.

商品描述(中文翻譯)

這本由Ford和Topp教授撰寫的《使用STL的C++資料結構》第二版，經過長時間的期待，提供了一種現代物件導向的方法來學習資料結構，並以標準模板庫（STL）的模型為基礎。作者圍繞容器和迭代器的概念統一了資料結構的學習。本書巧妙地發展了資料結構及其應用的演算法。讀者將會發現每個資料結構都有系統且詳細的實作。這些成功的作者提供了一個學習工具，並以豐富的優秀範例和完整的運行程式為動力。

主要特點
- 使用前幾章介紹資料結構核心的物件設計和程式設計原則。
- 開發清晰且簡潔的模板，支持全書的泛型程式設計。
- 全書使用STL容器類別。
- 為每個STL容器提供應用程式介面（API），並立即用於解決問題。
- 通過開發使用相應STL介面的迷你容器類別來演示STL類別的實作。學生可以理解容器的整體設計及其C++實作代碼。
- 包含對現代資料結構核心的迭代器的直觀且精確的介紹。
- 以同樣謹慎的風格涵蓋紅黑樹、雜湊表、堆和圖等進階主題。
- 提供讀者對於進階遞迴和繼承在資料結構中的廣泛發展。
- 提供有價值的教學特徵，包括章節目標和摘要；許多完整的程式及其運行輸出；案例研究；每章的複習練習及其解答；廣泛的書面和程式設計練習；以及每章的程式設計專案。
- 附錄：教師CD包含解答和測試項目檔案；伴隨網站包含語言教程、學生評估材料和PowerPoint簡報。

目錄
前言
1. 資料結構簡介
這本書的主題是什麼？資料結構的抽象視圖。作為類別的ADT。實作C++類別。宣告和使用物件。使用內聯代碼實作類別。應用程式介面（API）。字串。

2. 物件設計技術
軟體設計。處理運行時錯誤。物件組合。運算子重載。

3. 演算法簡介
選擇排序。簡單搜尋演算法。演算法分析。分析搜尋演算法。使演算法泛型。遞迴的概念。使用遞迴解決問題。

4. 向量容器
STL容器類別概述。模板類別。向量類別。向量應用。

5. 指標和動態記憶體
C++指標。動態記憶體。使用動態記憶體的類別。賦值和初始化。Minivector類別。Matrix類別。

6. 列表容器和迭代器
列表容器。迭代器。一般列表插入和刪除操作。案例研究：畢業名單。

7. 堆疊
堆疊ADT。遞迴代碼和運行時堆疊。堆疊實作。後綴表達式。案例研究：中綴表達式評估。

8. 隊列和優先隊列
隊列ADT。基數排序。實作Miniqueue類別。案例研究：時間驅動模擬。基於陣列的隊列實作。優先隊列。

9. 鏈結列表
鏈結列表節點。建立鏈結列表。處理列表的尾部。實作鏈結隊列。雙向鏈結列表。更新雙向鏈結列表。約瑟夫問題。Minilist類別。選擇序列容器。

10. 二元樹
樹結構。二元樹節點。二元樹掃描演算法。使用樹掃描演算法。二元搜尋樹。使用二元搜尋樹。實作Stree類別。Stree迭代器（可選）。

11. 關聯容器
關聯容器概述。集合。映射。多重集合。實作集合和映射。

12. 進階關聯結構
雜湊。設計雜湊函數。設計雜湊表。Hash類別。雜湊表性能。2-3-4樹。紅黑樹。Rbtree類別。

13. 繼承和抽象類別
C++中的繼承。圖形層次結構。圖形系統。安全向量。排序列表。多型和虛擬函數。抽象類別。

14. 堆、二進位檔案和位集
基於陣列的二元樹。堆。實作優先隊列。二進位檔案。位集。案例研究：霍夫曼壓縮。

15. 遞迴演算法
分治演算法。組合數學。動態規劃。回溯：八皇后問題。

16. 圖
圖術語。圖類別。圖類別設計。圖遍歷演算法。圖遍歷應用。圖最小化演算法。

索引。

類似商品