Data Structure with Java

Schaum's Outlines of Data Structures with Java
Publisher: McGraw-Hill pages: 384 2007 ISBN: 0071476989 PDF 12 mb
You can catch up on the latest developments in the number one, fastest-growing programming language in the world with this fully updated Schaum's guide. Schaum's Outline of Data Structures with Java has been revised to reflect all recent advances and changes in the language

CONTENTS
Chapter 1 Object-Oriented Programming 1
Software Design and Development 1
Object-Oriented Design 2
Abstract Data Types 3
Java Interfaces 4
Classes and Objects 5
Modifiers 8
Composition, Aggregation, and Inheritance 10
The Unified Modeling Language 13
Polymorphism 14
Javadoc 16
Chapter 2 Arrays 26
Properties of Arrays 26
Duplicating an Array 28
The java.util.Arrays Class 29
The Sequential Search Algorithm 30
The Binary Search Algorithm 31
Chapter 3 Linked Data Structures 46
Maintaining an Ordered Array 46
Indirect Reference 47
Linked Nodes 50
Inserting an Element into a Linked List 55
Inserting at the Front of the List 58
Deleting from a Sorted Linked List 59
Nested Classes 59
Chapter 4 The Java Collections Framework 69
The Inheritance Hierarchy 69
The Collection Interface 70
The HashSet Class 72
Generic Collections 74
Generic Methods 76
Generic Wildcards 76
Iterators 77
The TreeSet Class 79
The LinkedHashSet Class 83
The EnumSet Class 83
The List Interface 85
The ArrayList and Vector Classes 86
The LinkedList Class 86
The ListIterator Interface 87
The Queue Interface 87
The PriorityQueue Class 90
The Deque Interface and ArrayDeque Class 91
The Map Interface and Its Implementing Classes 92
The Arrays Class 95
The Collections Class 96
Autoboxing 97
Chapter 5 Stacks 103
Stack Operations 103
The JCF Stack Class 103
A Stack Interface 104
An Indexed Implementation 104
A Linked Implementation 106
Abstracting the Common Code 108
Application: An RPN Calculator 109
Chapter 6 Queues 117
Queue Operations 117
The JCF Queue Interface 117
A Simple Queue Interface 118
An Indexed Implementation 119
An Indexed Implementation 120
Application: A Client-Server System 121
Chapter 7 Lists 131
The JCF List Interface 131
The Range-View Operation sublist() 132
List Iterators 133
Other List Types 136
Application: The Josephus Problem 140
Application: A Polynomial Class 141
Chapter 8 Hash Tables 148
The Java Map Interface 148
The HashMap Class 149
Java Hash Codes 150
Hash Tables 151
Hash Table Performance 153
Collision Resolution Algorithms 154
Separate Chaining 156
Applications 157
The TreeMap Class 159
Chapter 9 Recursion 165
Simple Recursive Functions 165
Basis and Recursive Parts 166
Tracing A Recursive Call 167
The Recursive Binary Search 168
Binomial Coefficients 169
The Euclidean Algorithm 171
Inductive Proof of Correctness 171
Complexity Analysis 172
Dynamic Programming 173
The Towers of Hanoi 173
Mutual Recursion 175
Chapter 10 Trees 186
Tree Definitions 186
Decision Trees 188
Transition Diagrams 189
Ordered Trees 191
Traversal Algorithms 192
Chapter 11 Binary Trees 200
Definitions 200
Counting Binary Trees 201
Full Binary Trees 202
Identity, Equality, and Isomorphism 203
Complete Binary Trees 205
Binary Tree Traversal Algorithms 207
Expression Trees 209
A BinaryTree Class 211
Implementations of The Traversal Algorithms 216
Forests 219
Chapter 12 Search Trees 230
Multiway Search Trees 230
B-trees 232
Binary Search Trees 234
Performance of Binary Search Trees 236
AVL Trees 237
Chapter 13 Heaps and Priority Queues 245
Heaps 245
The Natural Mapping 245
Insertion Into A Heap 246
Removal From A Heap 247
Priority Queues 247
The JCF PriorityQueue Class 248
Chapter 14 Sorting 255
Code Preliminaries 255
The Java Arrays.sort() Method 256
The Bubble Sort 256
The Selection Sort 257
The Insertion Sort 258
The Shell Sort 259
The Merge Sort 260
The Quick Sort 263
The Heap Sort 265
The Speed Limit For Comparison Sorts 269
The Radix Sort 270
The Bucket Sort 271
Chapter 15 Graphs 285
Simple Graphs 285
Graph Terminology 285
Paths and Cycles 286
Isomorphic Graphs 288
The Adjacency Matrix for a Graph 290
The Incidence Matrix for a Graph 291
The Adjacency List for a Graph 291
Digraphs 292
Paths in a Digraph 294
Weighted Digraphs and Graphs 295
Euler Paths and Hamiltonian Cycles 295
Dijkstra’s Algorithm 297
Graph Traversal Algorithms 300
APPENDIX Essential Mathematics 319
The Floor and Ceiling Functions 319
Logarithms 319
Asymptotic Complexity Classes 320
The First Principle of Mathematical Induction 321
The Second Principle of Mathematical Induction 322
Geometric Series 323
Other Summation Formulas 323
Harmonic Numbers 324
Stirling’s Formula 325
Fibonacci Numbers 326
INDEX 329

Other Core of CS Books
Other Java Books
Download