出版时间:2001-5 出版社:高等教育出版社 作者:Robert L.Kruse,Alexander J.Ryba 页数:717 字数:1026000
Tag标签:无
内容概要
本书以C++为描述语言,系统介绍数据结构的有关内容及程序设计方法。每章都是先引入实例,然后结合实例讲解知识点,每章后都附有指针和陷阱的内容,还配有复习思考题,以检验读者的学习效果和培养读者的程序设计能力。此外,每章后还有深入学习本章知识点的阅读参考资料,有利于读者加深对本章知识点的理解。书后附录包括算法分析中的数学结论、随机数、程序包和实用函数,以及零散分布在书中的所有程序规则、指针和陷阱等。
全书既注重原理又重视实践,内容叙述详细,并配有大量的实例和习题。书中所有算法均在计算机上运行通过,且程序中做了较详细的注解,有利于读者理解算法的实质和编程思想。
本书既可作为高等学校计算机及相关专业学生的教材,亦可供从事计算机应用的工程技术人员参考,尤其适合那些使用C++语言编程的科技人员。
内容: 1. 程序设计原理 2. 栈的介绍 3. 队列 4. 链式栈和队列 5. 递归 6. 表和串 7. 查找 8. 排序 9.
数据表和信息检索 10. 二叉树 11. 多叉树 12. 图 13. 案例学习——波兰表示法。
作者简介
编者:(美国)克鲁斯 (Robert L.Kruse) Alexander J.Ryba
书籍目录
Preface
1 Programming Principles
1.1 Introduction
1.2 The Game of Life
1.3 Programming Style
1.4 Coding,Testing,and Turther Refinement
1.5 Program Maintenance
1.6 Conclusions and Preveiw
2 Introduction to Stacks
2.1 Stack Specifications
2.2 Implementation of Stacks
2.3 Application:A Desk Calculator
2.4 Application:Bracket Matching
2.5 Abstract Data Types and Their Implementations
3 Queues
3.1 Definitions
3.2 Implementations of Queues
3.3 Circular Implementation of Queues in C++
3.4 Demonstration and Testing
3.5 Application of Queues:Simulation
4 Linked Stacks and Queues
4.1 Pointers and Linked Structures
4.2 Linked Stacks
4.3 Linked Stacks with Safegards
4.4 Linked Queues
4.5 Application:Polynomial Arithmetic
4.6 Abstract Data Types and Their Implementations
5 Recursion
6 Lists and Srings
7 Searching
8 Sorting
9 Tables and Information rRtrieval
10 Binary Trees
11 Multiway Trees
12 Graphs
13 Case Study:The Polish Notation
A Mathematical Methods
B Random Numbers
C Packages and Utility Functions
D Programming Precepts,Pointers,and Pitfalls
Index
章节摘录
版权页:插图:It is the combination of flexibility, generality and efficiency that has made C++ oneof the most popular choices for programmers at the present time.We shall discover that the general principles that underlie the design of alldata structures are naturally implemented by the data abstractin and the object-oriented features of C++. Therefore, we shall carefully explain how these aspectsof C++ are used and briefly summarize their syntax (grammar) wherever they firstarise in our book. In this way, we shall illustrate and describe many of the featuresof C++ that do not belong to its small overlap with C. For the precise details of C++syntax, consult a textbook on C++ programming——we recommend several suchbooks in the references at the end of this chapter.Throughout this chapter we shall concentrate on one case study that, while notlarge by realistic standards, illustrates both the principles of program design andthe pitfalls that we should learn to avoid. Sometimes the example motivates generalprinciples; sometimes the general discussion comes first; always it is with the viewof discovering general principles that will prove their value in a range of practicalapplications. In later chapters we shall employ similar methods for larger projects.The example we shall use is the game called Life, which was introduced by theBritish mathematician J. H. CONWAY in 1970.Life is really a simulation, not a game with players. It takes place on an unboundedrectangular grid in which each cell can either be occupied by an organism or not.Occupied cells are called alive; unoccupied cells are called dead. Which cells arealive changes from generation to generation according to the number of neighbor-ing cells that are alive, as follows.
编辑推荐
《数据结构与程序设计:C++语言描述(影印版)》:教育部高等教育司推荐,国外优秀信息科学与技术系列教学用书。
图书封面
图书标签Tags
无
评论、评分、阅读与下载