《經典數據結構》是2005年7月清華大學出版社出版的圖書，作者是巴德。
基本介紹
- 書名：經典數據結構
- 作者：巴德
- ISBN：9787302111542
- 頁數：587
- 定價：43.0
- 出版社：清華大學出版社
- 出版時間：2005-7
- 裝幀：平裝
內容簡介,圖書目錄,
內容簡介
本書以Java 編程為描述方法，以UML為建模工具，套用面向對象的編程方法研究經典數據結構。全書介紹了面向對象的編程方法和Java GUI編程方法，並且著重討論了一些經典的數據結構，並配有精心設計的實驗程式以加強讀者對基本概念和原理的理解。同時介紹了UML、算法複雜度的簡單概念以及本書所用到的Foundations類庫的安裝與使用。
圖書目錄
PREFACE XV
1 THE MANAGEMENT OF COMPLEXITY
1.1 The Control of Complexity
1.2 Abstraction, Information Hiding, and Layering
1.3 Division into Parts
1.4 Composition
1.5 Layers of Specialization
1.6 Multiple Views
1.7 Patterns
1.8 Chapter Summary
Further Information
Study Questions
Exercises
Programming Projects
2 ABSTRACT DATA TYPES
2.1 What Is a Type?
2.2 Abstract Data Types
2.3 The Fundamental ADTs
2.4 Chapter Summary
Further Information
Study Questions
Exercises
Programming Projects
3 ALGORITHMS
3.1 Characteristics of Algorithms
3.2 Recipes as Algorithms
3.3 Analyzing Computer Algorithms
3.4 Recursive Algorithms
3.5 Chapter Summary
Further Information
Study Questions
Exercises
Programming Projects
4 EXECUTION-TIME MEASUREMENT
4.1 Algorithmic Analysis and Big-Oh Notation
4.2 Execution Time of Programming Constructs
4.3 Summing Algorithmic Execution Times
4.4 The Importance of Fast Algorithms
4.5 Benchmarking Execution Times
4.6 Chapter Summary
Further Information
Study Questions
Exercises
Programming Projects
5 INCREASING CONFIDENCE IN CORRECTNESS
5.1 Program Proofs
5.2 Program Testing
5.3 Chapter Summary
Further Information
Study Questions
Exercises
Programming Projects
6 VECTORS
6.1 The Vector Data Structure
6.2 Enumeration
6.3 Application-Silly Sentences
6.4 Application-Memory Game
6.5 Application-Shell Sort
6.6 A Visual Vector
6.7 Chapter Summary
Further Information
Study Questions
Exercises
Programming Projects
7 SORTING VECTORS
7.1 Divide and Conquer
7.2 SortedVectors
7.3 Merge Sort
7.4 Partitioning
7.5 Chapter Summary
Further Information
Study Questions
Exercises
Programming Projects
8 LINKED LISTS
8.1 Varieties of Linked Lists
8.2 LISP-Style Lists
8.3 The LinkedList Abstraction
8.4 Application-Asteroids Game
8.5 Application-Infinite-Precision Integers
8.6 Chapter Summary
Further Information
Study Questions
Exercises
Programming Projects
9 LIST VARIATIONS
……
10 STACKS
11 DEQUES
12. QuEuEs
13 TREES
14 BINARY SEARCH TREES
15 PRIORITY QUEUES
16 HASH TABLES
17 MAPS
18 SETS
19 MATRICES
20 GRAPHS
APPENDIX A JAVA SYNTAX
APPENDIX B IMPORT LIBRARIES
APPENDIX C DATA STRUCTURES IN THE JAVA STANDARD LIBRARY
BIBLIOGRAPHY
INDEX
1 THE MANAGEMENT OF COMPLEXITY
1.1 The Control of Complexity
1.2 Abstraction, Information Hiding, and Layering
1.3 Division into Parts
1.4 Composition
1.5 Layers of Specialization
1.6 Multiple Views
1.7 Patterns
1.8 Chapter Summary
Further Information
Study Questions
Exercises
Programming Projects
2 ABSTRACT DATA TYPES
2.1 What Is a Type?
2.2 Abstract Data Types
2.3 The Fundamental ADTs
2.4 Chapter Summary
Further Information
Study Questions
Exercises
Programming Projects
3 ALGORITHMS
3.1 Characteristics of Algorithms
3.2 Recipes as Algorithms
3.3 Analyzing Computer Algorithms
3.4 Recursive Algorithms
3.5 Chapter Summary
Further Information
Study Questions
Exercises
Programming Projects
4 EXECUTION-TIME MEASUREMENT
4.1 Algorithmic Analysis and Big-Oh Notation
4.2 Execution Time of Programming Constructs
4.3 Summing Algorithmic Execution Times
4.4 The Importance of Fast Algorithms
4.5 Benchmarking Execution Times
4.6 Chapter Summary
Further Information
Study Questions
Exercises
Programming Projects
5 INCREASING CONFIDENCE IN CORRECTNESS
5.1 Program Proofs
5.2 Program Testing
5.3 Chapter Summary
Further Information
Study Questions
Exercises
Programming Projects
6 VECTORS
6.1 The Vector Data Structure
6.2 Enumeration
6.3 Application-Silly Sentences
6.4 Application-Memory Game
6.5 Application-Shell Sort
6.6 A Visual Vector
6.7 Chapter Summary
Further Information
Study Questions
Exercises
Programming Projects
7 SORTING VECTORS
7.1 Divide and Conquer
7.2 SortedVectors
7.3 Merge Sort
7.4 Partitioning
7.5 Chapter Summary
Further Information
Study Questions
Exercises
Programming Projects
8 LINKED LISTS
8.1 Varieties of Linked Lists
8.2 LISP-Style Lists
8.3 The LinkedList Abstraction
8.4 Application-Asteroids Game
8.5 Application-Infinite-Precision Integers
8.6 Chapter Summary
Further Information
Study Questions
Exercises
Programming Projects
9 LIST VARIATIONS
……
10 STACKS
11 DEQUES
12. QuEuEs
13 TREES
14 BINARY SEARCH TREES
15 PRIORITY QUEUES
16 HASH TABLES
17 MAPS
18 SETS
19 MATRICES
20 GRAPHS
APPENDIX A JAVA SYNTAX
APPENDIX B IMPORT LIBRARIES
APPENDIX C DATA STRUCTURES IN THE JAVA STANDARD LIBRARY
BIBLIOGRAPHY
INDEX
