图书介绍
数据结构习题与解答 C++语言描述 英文版PDF|Epub|txt|kindle电子书版本网盘下载
- （美）John R.Hubbard著 著
- 出版社： 北京：机械工业出版社
- ISBN：7111105796
- 出版时间：2002
- 标注页数：407页
- 文件大小：24MB
- 文件页数：416页
- 主题词：数据结构(学科: 习题) 数据结构
PDF下载
下载说明
数据结构习题与解答 C++语言描述 英文版PDF格式电子书版下载
下载的文件为RAR压缩包。需要使用解压软件进行解压得到PDF格式图书。建议使用BT下载工具Free Download Manager进行下载,简称FDM(免费,没有广告,支持多平台）。本站资源全部打包为BT种子。所以需要使用专业的BT下载软件进行下载。如BitComet qBittorrent uTorrent等BT下载工具。迅雷目前由于本站不是热门资源。不推荐使用！后期资源热门了。安装了迅雷也可以迅雷进行下载！
（文件页数 要大于 标注页数，上中下等多册电子书除外）
注意：本站所有压缩包均有解压码： 点击下载压缩包解压工具
图书目录
Chapter 1 Review of C++1
1.1 THE STANDARD C++PROGRAMMING LANGUAGE1
1.2 CONDITIONALS3
1.3 OPERATORS5
1.4 ITERATION6
1.5 FUNCTIONS8
1.6 STRINGS10
1.7 FILES12
2.1 POINTERS25
Chapter 2 Pointers and Arrays25
2.2 DERIVED TYPES26
2.3 REFERENCES27
2.4 PASSING BY REFERENCE27
2.5 NULL POINTER EXCEPTIONS29
2.6 THE new AND delete OPERATORS29
2.7 ARRAYS31
2.8 DYNAMIC ARRAYS32
2.9 PASSING AN ARRAY TO A FUNCTION32
2.10 MULTIDIMENSIONAL ARRAYS33
3.1 A Point CLASS47
Chapter 3 Classes47
3.2 INSTANCESIMPLICIT ARGUMENTS,AND THE this POINTER49
3.3 COMPILING CLASSES AND THEIR CLIENT PROGRAMS50
3.4 FRIEND FUNCTIONS53
3.5 A Line CLASS54
3.6 A CLASS FOR RANDOM NUMBERS56
3.7 STATIC MEMBERS57
3.8 COMPOSITION59
3.9 INHERITANCE61
4.1 THE FACTORIAL FUNCTION76
Chapter 4 Recursion76
4.2 TRACING A RECURSIVE CALL77
4.3 THE FIBONACCI SEQUENCE77
4.4 BINOMIAL COEFFICIENTS78
4.5 THE EUCLIDEAN ALGORITHM79
4.6 INDUCTIVE PROOF OF CORRECTNESS80
4.7 COMPLEXITY ANALYSIS OF RECURSIVE ALGORIHMS81
4.8 DYNAMIC PROGRAMMING82
4.9 THE TOWERS OF HANOI82
4.10 MUTUAL RECURSION84
5.2 USING stack OBJECTS92
Chapter 5 Stacks92
5.1 THE stack INTERFACE92
5.3 APPLICATIONS OF STACKS93
5.4 REMOVING RECURSION96
5.5 CONTIGUOUS IMPLEMENTATION97
5.6 LINKED IMPLEMENTATION100
Chapter 6 Queues110
6.1 THE queue INTERFACE110
6.2 USING queue OBJECTS110
6.3 APPLICATIONS OF QUEUES112
6.4 CONTIGUOUS IMPLEMENTATION115
6.5 LINKED IMPLEMENTATION118
Chapter 7 Lists127
7.1 THE list INTERFACE127
7.2 USING list OBJECTS128
7.3 ITERATORS129
7.4 APPLICATIONS130
7.5 CIRCULAR LISTS134
7.6 ORDERED LISTS136
7.7 AN UNBOUNDED Integer CLASS137
7.8 IMPLEMENTION OF THE List CLASS142
Chapter 8 Tables155
8.1 THE STANDARD pair TYPE155
8.2 APPLICATIONSUSINGTHE map CLASSTEMPLATE157
8.3 HASH TABLES161
8.4 HASH FUNCTIONS165
8.5 SEPARATE CHAINING167
Chapter 9 Trees174
9.1 TREE TERMINOLOGY174
9.2 DECISION TREES AND TRANSITION DIAGRAMS176
9.3 TREE TRAVERSAL ALGORITHMS178
9.4 A Tree CLASS INTERFACE180
9.5 IMPLEMENTATION OF THE Tree CLASS182
Chapter 10 Binary Trees200
10.1 DEFINITIONS200
10.2 COUNTING BINARY TREES201
10.3 FULL BINARY TREES202
10.4 IDENTITY,EQUALITY,AND ISOMORPHISM203
10.5 COMPLETE BINARY TREES204
10.6 TREE TRAVERSALS206
10.7 EXPRESSION TREES208
10.9 A BinaryTree CLASS INTERFACE210
10.8 FORESTS210
10.10 IMPLEMENTATION OF THE BinaryTree CLASS213
Chapter 11 Search Trees224
11.1 BINARY SEARCH TREES224
11.2 IMPLEMENTATION OF BINARY SEARCH TREES225
11.3 PERFORMANCE CHARACTERISTICS OF BINARY SEARCH TREES228
11.4 AVL TREES228
12.2 THE NATURAL MAPPING235
Chapter 12 Heaps and Priority Queues235
12.1 HEAPS235
12.3 INSERTION INTO A HEAP236
12.4 REMOVAL FROM A HEAP237
12.5 PRIORITY QUEUES238
12.6 USING priority_queue OBJECTS238
12.7 USING A HEAP TO IMPLEMENT A PriorityQueue CLASS TEMPLATE239
12.8 APPLICATIONS OF PRIORITY QUEUES241
13.1 PRELIMINARIES248
13.2 THE BUBBLE SORT248
Chapter 13 Sorting248
13 3 THE SELECTION SORT250
13.4 THE INSERTION SORT251
13.5 THE MERGE SORT252
13.6 THE QUICK SORT255
13.7 HEAPS256
13.8 THE HEAP SORT257
13.9 THE SHELL SORT261
13.10 THE SPEED LIMIT FOR EXCHANGE SORTS262
Appendix A References268
B.2 LOGARITHMS275
Appendix B Essential Mathematics275
B.1 THE FLOOR AND CEILING FUNCTIONS275
B.3 THE FIRST PRINCIPLE OF MATHEMATICAL INDUCTION276
B.4 THE SECOND PRINCIPLE OF MATHEMATICAL INDUCTION277
B.5 GEOMETRIC SERIES278
B.6 SUMMATION FORMULAS278
B.7 ASYMPTOTIC COMPLEXITY CLASSES279
B.8 HARMONIC NUMBERS279
B.9 STIRLING'S FORMULA281
B.10 FIBONACCI NUMBERS281
B.11 THE GOLDEN MEAN282
B.12 THE EUCLIDEAN ALGORITHM283
Appendix C Standard Container Classes285
C.1 THE vector CLASS TEMPLATE285
C.2 THE deque CLASS TEMPLATE290
C.3 THE stack CLASS TEMPLATE290
C.4 THE queue CLASS TEMPLATE291
C.5 THE priority_queue CLASS TEMPLATE291
C.6 THE list CLASS TEMPLATE292
C.7 THE map CLASS TEMPLATE294
C.8 THE set CLASS TEMPLATE296
Appendix D Generic Algorithms299
Appendix E Example Classes328
E.1 A BinaryTree CLASS328
E.2 A BinarySearchTree CLASS335
E.3 A Card CLASS336
E.4 A Concordance CLASS339
E.5 A Date CLASS340
E.6 A Deck CLASS347
E.7 A Hand CLASS348
E.9 A HashTable CLASS TEMPLATE349
E.8 A Hash FUNCTION STRUCTURE TEMPLATE349
E.10 A Line CLASS351
E.11 A List CLASS TEMPLATE353
E.12 A Matrix CLASS TEMPLATE358
E.13 AN OrderedList CLASS360
E.14 A Peraon CLASS361
E.15 A Point CLASS363
E.16 A Polynomial CLASS367
E.17 A PriorityQueue CLASS TEMPLATE372
E.18 A Purse CLASS374
E.19 A Queue CLASS376
E.20 A Random CLASS377
E.21 A RandomLine CLASS378
E.22 A RandomPoint CLASS378
E.23 A Ratio CLASS379
E.24 A Rational CLASS381
E.25 A SelforganizingList CLASS384
E.26 A StackCLASS TEMPLATE384
E.27 A Tree CLASS386
Index399