基本信息·出版社：清华大学出版社 ·页码：879 页 ·出版日期：2004年10月 ·ISBN：9787302097655 ·条形码：9787302097655 ·版本：第1版 ·装帧：平装 ...
| 商家名称 |
信用等级 |
购买信息 |
订购本书 |
|
|
 |
数据结构与问题求解(C++版)(影印版) |
 |
|
|
数据结构与问题求解(C++版)(影印版) |
|
基本信息·出版社：清华大学出版社
·页码：879 页
·出版日期：2004年10月
·ISBN：9787302097655
·条形码：9787302097655
·版本：第1版
·装帧：平装
·开本：16
·正文语种：英语
·丛书名：大学计算机教育国外著名教材系列
·外文书名：DATA STUCTURES AND PROBLEM SOLVING USING
内容简介 《数据结构与问题求解》使用流行的C++语言作为描述语言，详细介绍了数据结构和算法。
全书共分为五大部分。第一部分的C++教程是全书的基础，具体讲述C++的运行环境、数据类型和运算符、基本语法等；同时介绍了面向对象的一些概念。第二部分对C++的各种数据结构接口和其中涉及到的算法及算法分析进行了详细介绍，并用实例说明了如何使用这些数据结构。第三部分是这些数据结构的实际应用，第一章对不同应用的理论和具体实现做了详尽阐述。第四部分则针对各种数据结构接口、分别给予更加细致的实例解说。第五部分介绍了一些高级的数据结构。
通过对《数据结构与问题求解》的学习，读者能够抽象地思考不同数据结构的功能，了解它们之间的相关性，掌握在计算机工程中使用这些数据结构的能力。《数据结构与问题求解》概念清楚，逻辑性强，内容新颖，可作为高等院校计算机软件专业与计算机应用专业学生的教材和参考用书，也可供计算机工程技术人员参考。
目录 Part I：Objects and C++
Chapter 1 Arrays，Pointers，and Structures
1．1 What Are Pointers。Arrays，and Structures？
1．2 Arrays andStrings
1．2．1 First-Class Versus Second-Class Obiects
1．2．2 Using the vector
1．2．3 Resizing a vector
1．2．4 push_back：sizeandcapacity
1．2．5 Parameter-Passing Mechanisms
1．2．6 Primitive Arrays Of Constants
1．2．7 Multidimensional Arrays
1．2．8 The StandardLibrary string Type
1．3 Pointer Syntax in C++
1．4 Dynamic Memory Management
1．4．1 The new Operator
1．4．2 Garbage Collection and delete
1．4．3 Stale Pointers，Double Deledon，and More
1．5 Reference Variables
1．6 Structures
1．6．1 Pointers to Structures
1．6．2 Exogenous Versus Indigenous Data and Shallow Versus Deep Copying
1．6．3 NoncOntiguOus Lists：Linked Lists
Summary
Objects oftIle Game
Common Errors
Onthe Intemet
Exercises
References
Chapter 2 Objects and Classes
2．1 What Is Object-Oriented Programming？
2．2 Basic class Syntax
2．2．1 Class Members
2．2．2 Extra Constructor Syntax and Accessors
2．2．3 Separation of Interface and Implementation
2．2．4 The Big Three：Destructor，Copy Constructor，and operator
2．2．5 Default Constructor
2．3 Additional C++Class Features
2．3．1 Initialization Versus Assignment in the Constructor Revisited
2．3．2 Type Conversions
2．3．3 Operator Overloading
2．3．4 InputandOutputandFriends
2．4 Some Common Idioms
2．4．1 Avoiding Friends
2．4．2 Static Class Members
2．4．3 The anum Trick for Integer Class Constants
2．5 Exceptions
2．6 A string Class
2．7 Recap：What Gets Cailed and What Are the Defaults？
2．8 Composition
Summary
Objcots of the Game
CommonErrors
On the Internet
Exercises
References
Chapter 3 Templates
3．1 WhatIs aTemplate？
3．2 Function Templates
3．3 A Sorting Function Template
3．4 Class Templates
3．4．1 A MemoryCell Template
3．4．2 Implementing the vector Class Template
3．5 Templates of Templates：A matrix Class
3．5．1 T11e Data Members，Constructor,and Basic Accessors
3．5．2 operator[]
3．5．3 Destrucmr，Copy Assignment，and Copy Constructor
3.6 Fancy Templates
3.6.1 Multiple Template Parameters
3.6.2 Default Template Parameters
3.6.3 The Reserved Word typename
3.7 Bugs Associated with Templates
3.7.1 Bad Error Messages and Inconsistent Rules
3.7.2 Template-Matching Algorithms
3.7.3 Nested Classes in a Template
3.7.4 Static Members in Class Templates
Summary
Objects of the Game
Common Errors
On the Internet
Exercises
Chapter 4 Inheritance
4.1 What Is Inheritance？
4.2 Inheritance Basics
4.2.1 Visibility Rules
4.2.2 The Constructor and Base Class Initialization
4.2.3 Adding Members
4.2.4 Overriding a Method
4.2.5 Static and Dynamic Binding
4.2.6 The Default Constructor, Copy Constructor, Copy Assignment Operator, and Destructor
4.2.7 Constructors and Destructors: Virtual or Not Virtual？
4.2.8 Abstract Methods and Classes
4.3 Example: Expanding the shape Class
4.4 Tricky C++ Details
4.4.1 Static Binding of Parameters
4.4.2 Default Parameters
4.4.3 Derived Class Methods Hide Base Class Methods
4.4.4 Compatible Return Types for Overridden Methods
4.4.5 Private Inheritance
4.4.6 Friends
4.4.7 Call by Value and Polymorphism DoNot Mix
4.5 Multiple Inheritance
Summary
Objects of the Game
Common Errors
On the Internet
Exercises
References
Chapter 5 Design Patterns
5.1 What Is a Pattern？
5.2 The Functor （Function Objects）
5.3 Adapters and Wrappers
5.3.1 Wrapper for Pointers
5.3.2 A Constant Reference Wrapper
5.3.3 Adapters: Changing an Interface
5.4 Iterators
5.4.1 Iterator Design 1
5.4.2 Iterator Design 2
5.4.3 Inheritance-Based Iterators and Factories
5.5 Composite （Pair）
5.6 Observer
Summary
Objects of the Game
Common Errors
On the Internet
Exercises
References
Part H: Algorithms and Building Blocks
Chapter 6 Algorithm Analysis
6.1 What Is Algorithm Analysis？
6.2 Examples of Algorithm Running Times
6.3 The Maximum Contiguous Subsequence Sum Problem
6.3.1 The Obvious O（N3） Algorithm
6.3.2 An Improved O（N2） Algorithm
6.3.3 A Linear Algorithm
6.4 General Big-Oh Rules
6.5 The Logarithm
6.6 Static Searching Problem
6.6.1 Sequential Search
6.6.2 Binary Search
6.6.3 Interpolation Search
6.7 Checking an Algorithm Analysis
6.8 Limitations of Big-Oh Analysis
Part III. APPLICATIONS.
Chapter 11. Fun and Games.
Chapter 12. Stacks and Compilers.
Chapter 13. Utilities.
Chapter 14. Simulation.
Chapter 15. Graphs and Paths.
Part IV. IMPLEMENTATIONS.
Chapter 16. Stacks and Queues.
Chapter 17. Linked Lists.
Chapter 18. Trees.
Chapter 19. Binary Search Trees.
Chapter 20. Hash Tables.
Chapter 21. A Priority Queue: The Binary Heap.
Part V. ADVANCED DATA STRUCTURES.
Chapter 22. Splay Trees.
Chapter 23. Merging Priority Queues.
Chapter 24. The Disjoint Set Class.
Appendix A: Miscellaneous C++ Details
Appendix B: Operators.
Appendix C: Some Library Routines.
Appendix D: Primitive Arrays in C++
……
序言 This book is designed for a two．semester sequence in computer science，beginning with what iS typically known as Data Structures(cs．2) and con．tinuing wlth advanced data structures and algorithm analysis． The content of the CS·2 course has been evolving for some time．Although there lS some general consensus concerning topic coverage，con-siderable disagreement still exists over the details．One uniformly acceptedtopic IS principles of SOftware development，most notably the concepts ofencapsulation and information hiding．Algorithmically．all CS一2 coursestend to include an introduction to running-time analysis，recursion，basicsorting algorithms，and elementary data structures．An advanced course iSoffered at many universities tIlat covers topics in data structures，algorithms，and running-time analysis at a higher level．The materialin this text has beendesigned for use in both levels of courses．thus eliminating the need to pur-chase a second textbook． Although the most passionate debates in CS一2 revolve around the choiceof a programmmg language，other fundamental choices need to be made。
文摘 插图：
