數(shù)據(jù)結(jié)構(gòu)與算法：Java語言版（英文版·第二版）

定　價：￥79.00

作　者：	（美）德羅茲德克著
出版社：	機械工業(yè)出版社
叢編項：	經(jīng)典原版書庫
標(biāo)　簽：	數(shù)據(jù)結(jié)構(gòu)

購買這本書可以去

ISBN：	9787111188261	出版時間：	2006-04-01	包裝：	膠版紙
開本：	小16開	頁數(shù)：	782	字數(shù)：

內(nèi)容簡介

　　數(shù)據(jù)結(jié)構(gòu)和算法課程是計算機科學(xué)教育的核心內(nèi)容，本書提供了該領(lǐng)域必備的知識。根據(jù)當(dāng)前的設(shè)計和實現(xiàn)范例，本書以面向?qū)ο蟮姆绞矫枋鰯?shù)據(jù)結(jié)構(gòu)，深入淺出地講解了相關(guān)的難點。Drozdek強調(diào)了數(shù)據(jù)結(jié)構(gòu)和算法之間的關(guān)系，分析了算法的復(fù)雜性，還講解了增強封裝和分解的信息隱藏原理，對遞歸方法進行了清晰的闡述，詳盡地描述了不同類型的遞歸。本書第1版取材新穎，被很多學(xué)校采用為教學(xué)參考書。第2版在延續(xù)了第1版理論結(jié)合實際的風(fēng)格的同時，在理論上更精深了一層，添加了很多數(shù)據(jù)結(jié)構(gòu)的經(jīng)典問題與新的思想，比如NP完整性、圖論中的團問題以及結(jié)合自動機理論探討的字符串匹配技術(shù)等。本書主要特點●示例學(xué)習(xí)。貫穿全書，從實際應(yīng)用的角度詮釋概念?！窬幊套鳂I(yè)。為讀者提供大量的實踐機會。●豐富的圖表。增強對數(shù)據(jù)結(jié)構(gòu)用途的理解?！袂逦仃U述遞歸。即使對高年級學(xué)生而言，這也是具有挑戰(zhàn)性的主題。

作者簡介

　　AdamDrozdek，畢業(yè)于美國萊特州立大學(xué)，現(xiàn)任迪尤肯大學(xué)計算機系副教授。曾出版多部著作，包括《DataStructesandAlgorithmsinC++》和《TheElementsofdataCompression》等。

圖書目錄

1 Object-Oriented Programming Using Java
1.1    Rudimentary Java
1.2    Object-Oriented Porgramming in Java
1.3    Imput and Output
1.4    Java and Pointers
1.5    Vectors in java.util
1.6    Data Structures and Object-Oriented Programming
1.7    Case Study:Random Access File
1.8    Exercises
1.9    Programming Assignments
Bibliography
2 Complexity Analysis
2.1    Computational and Asymptotic Complexity
2.2    Big-O Notation
2.3    Properties of Big-O Notation
2.4    ΩandΘNotations
2.5    Possible Problems
2.6    Examples of Complexities
2.7    Finding Asymptotic Complexity:Examples
2.8    The Best,Average,and Worst Cases
2.9    Amortized Complexity
2.10    NP-Completeness
2.11    Exercises
Bibliography
3 LINKED LISTS
3.1    Singly Linked Lists
3.2    Doubly Linked Lists
3.3    Circular Lists
3.4    Skip Lists
3.5    Self-Organizing lists
3.6    Sparse Tables
3.7    Lists in java.util
3.8    Concluding Remarks
3.9    Case Study:A Library
3.10    Exercises
3.11    Programming Assignments
Bibliography
4 STACKS AND QUEUES
4.1    Stacks
4.2    Queues
4.3    Priority Queues
4.4    Case Study:Exiting a Maze
4.5    Exercises
4.6    Programming Assignments
Bibliography
5 RECURSION
5.1    Recursive Definitions
5.2    Method Calls and Recursion Implementation
5.3    Anatomy of a Recursive Call
5.4    Tail Recursion
5.5    Nontail Recursion
5.6    Indirect Recursion
5.7    Nested Recursion
5.8    Excessive Recursion
5.9    Backtracking
5.10    Concluding Remarks
5.11    Case Study:A Recursive Descent Interpreter
5.12    Exercises
5.13    Programming Assignments
Bibliography
6 BINARY TREES
6.1    Trees,Binary Trees,and Binary Search Trees
6.2    Implementing Binary Trees
6.3    Searching a Binary Search Tree
6.4    Tree Traversal
6.5    Insertion
6.6    Deletion
6.7    Balancing a Tree
6.8    Self-Adjusting Trees
6.9    Heaps
6.10    Polish Notation and Expression Trees
6.11    Case Study:Computing Word Frequencies
6.12    Exercises
6.13    Programming Assignments
Bibliography
7 MULTIWAY TREES
7.1    The Family of B-Trees
7.2    Tries
7.3    Concluding Remarks
7.4    Case Study:Spell Checker
7.5    Exercises
7.6    Programming Assignments
Bibliography
8 GRAPHS
8.1    Graph Representation
8.2    Graph Traversals
8.3    Shortest Paths
8.4    Cycle Detection
8.5    Spanning Trees
8.6    Connectivity
8.7    Topological sort
8.8    Netwoks
8.9    Matching
8.10    Eulerian and Hamiltonian Graphs
8.11    Graph Coloring
8.12    NP-Complete Problems in Graph Theory
8.13    Case Study:Distinct Rpresentatives
8.14    Exercises
8.15    Programming Assignments
Bibliography
9 SORTING
9.1    Elementary Sorting Algorithms
9.2    Decision Trees
9.3    Efficient Sorting Algorithms
9.4    Sorting in java.util
9.5    Concluding Remarks
9.6    Case Study:Adding Polynomials
9.7    Exercises
9.8    Programming Assignments
Bibliography
10 HASHING
10.1    Hash Functions
10.2    Collision Resolution
10.3    Deletion
10.4    Perfect Hash Functions
10.5    Hash Functions for Extendible Files
10.6    Hashing in java.util
10.7    Case study:Hashing with Buckets
10.8    Exercises
10.9    Programming Assignments
Bibliography
11 DATA COMPRESSION
11.1    Conditions for Data Compression
11.2    Huffman Coding
11.3    Run-Length Encoding
11.4    Ziv-Lempel Code
11.5    Case Study:Huffman Method with Run-Length Encoding
11.6    Exercises
11.7    Programming Assignments
Bibliography
12 MEMORY MANAGEMENT
12.1    The  Sequential-Fit Methods
12.2    The Nonsequential-Fit Methods
12.3    Garbage Collection
12.4    Concluding Remarks
12.5    Case Study:An In-Place Garbage Collector
12.6    Exercises
12.7    Programming Assignments
Bibliography
13 STRING MATCHING
13.1    Exact String Matching
13.2    Approximate String Matching
13.3    Case Study:Longest Common Substring
13.4    Exercises
13.5    Programming Assignments
Bibliography
APPENDIXES
A Computing Big-O
B NP-Completeness
Name Index
Subject Index