经典数据结构

当前位置:首页 > 计算机网络 > 征订教材 > 经典数据结构

出版社:第1版 (2005年7月1日)
出版日期:2005-7
ISBN:9787302111542
作者:巴德
页数:587页

书籍目录

PREFACE XV1 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

作者简介

本书以Java 编程为描述方法,以UML为建模工具,应用面向对象的编程方法研究经典数据结构。全书介绍了面向对象的编程方法和Java GUI编程方法,并且着重讨论了一些经典的数据结构,并配有精心设计的实验程序以加强读者对基本概念和原理的理解。同时介绍了UML、算法复杂度的简单概念以及本书所用到的Foundations类库的安装与使用。

图书封面


 经典数据结构下载



发布书评

 
 


 

外国儿童文学,篆刻,百科,生物科学,科普,初中通用,育儿亲子,美容护肤PDF图书下载,。 零度图书网 

零度图书网 @ 2024