2003年清华大学出版社出版书籍数据结构与算法 _生活百科

文章插图
数据结构与算法(2003年清华大学出版社出版书籍)【2003年清华大学出版社出版书籍数据结构与算法】《数据结构与算法》是2003年清华大学出版社出版的图书，作者是Alfred V.Aho、John E.Hopcroft 。
基本介绍书名：数据结构与算法
作者：Alfred V.Aho、John E.Hopcroft
ISBN：9787302075646
定价：40
出版社：清华大学出版社
出版时间：2003年12月1日
内容简介本书是由计算机科学研究和教学的三位大师编写的，主要阐释了数据结构和算法两大部分，内容包括数据结构的各种基本概念，如数组、列表、栈、伫列、映射、叠代、树、有向图与无向图等，以及各种算法的概念与方法，如排序、搜寻、外存与内容管理等。对各种算法都给出了详细的示例和插图。本书出版20多年以来，仍然是国内外数据结构与算法课程中推荐使用最广的教材，是一本经受了时间考验的经典之作。本书概念讲解清楚，逻辑性强，可作为相关课程的教材或参考书，也可供从事计算机工程的技术人员参考。目录Chapter 1 Design and Analysis of Algorithms1.1 From Problems to Programs1.2 Abstract Data Types1.3 Data Types,Data Structures,and Abstract Data Types1.4 The Running Time of a Program1.5 Calculating the Running Time of a Program1.6 Good Programming Practice1.7 Super PascalChapter 2 Basic Data Types2.1 The Data Type“List”2.2 Implementation of Lists2.3 Stacks2.4 Queues2.5 Mappings2.6 Stacks and Recursive ProceduresChapter 3 Trees3.1 Basic Terminology3.2 The ADT TREE3.3 Implementations of Trees3.4 Binary TreesChapter 4 Basic Operations on Sets4.1 Introduction to Sets4.2 An ADT with Union,Intersection,and Difference4.3 A Bit-Vector Implementation of Sets4.4 A Linked-List Implementation of Sets4.5 The Dictiionary4.6 Simple Dictionary Implementation4.7 The Hash Table Data Structure4.8 Estimating the Efficiency of Hash Functions4.9 Implementation of the Mapping ADT4.10 Priority Queues4.11 Implementations of Priority Queues4.12 Some Complex Set StructuresChapter 5 Advanced Set Representation Methods5.1 Binary Search Trees5.2 Time Analysis of Binary Search Tree Operations5.3 Tries5.4 Balanced Tree Implementations of Sets5.5 Sets with the MERGE and FIND Operations5.6 An ADT with MERGE and SPLITChapter 6 Directed Graphs6.1 Basic Definitions6.2 Representations for Directed Graphs6.3 The Single-Source Shortest Paths Problem6.4 The All-Pairs Shortest Path Problem6.5 Traversals of Directed Graphs6.6 Directed Acyclic Graphs6.7 Strong ComponentsChapter 7 Undirected Graphs7.1 Definitions7.2 Minimum-Cost Spaning Trees7.3 Traversals7.4 Articulation Points and Biconnected Components7.5 Graph MatchingChapter 8 Sorting8.1 The Internal Sorting Model8.2 Some Simple Sorting Schemes8.3 Quicksort8.4 Heapsort8.5 Bin Sorting8.6 A Lower Bound for Sorting by Comparisons8.7 Order StatisticsChapter 9 Algorithm Analysis Techniques9.1 Efficiency of Algorithms9.2 Analysis of Recursive Programs9.3 Solving Recurrence Equations9.4 A General Solution for a Large Class of RecurrencesChapter 10 Algorithm Design Techniques 10.1 Divide-and-Conquer Algorithms10.2 Dyamic Programming10.3 Greedy Algorithms10.4 Backtracking10.5 Local Search AlgorithmsChapter 11 Data Structures and Algorithms for External Storage11.1 A Model of External Computation11.2 External Sorting11.3 Storing Information in Files11.4 External Search TreesChapter 12 Memory Management12.1 The Issues in Memory Management12.2 Managing Equal-Sized Blocks12.3 Garbage Collection Algorithms for Equal-Sized Blocks12.4 Storage Allocation for Objects with Mixed Sizes12.5 Buddy Systems12.6 Storage CompactionBibliographyIndex

2003年清华大学出版社出版书籍 数据结构与算法

2003年清华大学出版社出版书籍数据结构与算法