A practical guide to data structures and algorithms using Java
by
 
Goldman, Sally A. (Sally Ann), author.

Title
A practical guide to data structures and algorithms using Java

Author
Goldman, Sally A. (Sally Ann), author.

ISBN
9780429147104

Physical Description
1 online resource (xxvii, 1026 pages).

Series
Chapman & Hall/CRC applied algorithms and data structures series

Contents
chapter 1 Part I. INTRODUCTION -- chapter 1 Design Principles -- chapter 2 Selecting an Abstract Data Type -- chapter 3 How to Use This Book -- chapter 2 COLLECTION DATA STRUCTURES AND ALGORITHMS -- chapter 4 Part II Organization -- chapter 5 Foundations -- chapter 6.Partition ADT and the Union-Find Data Structure -- chapter 7 Collection of Elements -- chapter 8 Abstract Collection -- chapter 9 Positional Collection ADT -- chapter 10 Abstract Positional Collection -- chapter 11 Array Data Structure -- chapter 12 Circular Array Data Structure -- chapter 13 Dynamic Array and Dynamic Circular Array Data Structures -- chapter 14 Tracked Array Data Structure -- chapter 15 Singly Linked List Data Structure -- chapter 16 Doubly Linked List Data Structure -- chapter 17 Buffer ADT and Its Implementation -- chapter 18 Queue ADT and Implementation -- chapter 19 Stack ADT and Implementation -- chapter 20 Set ADT -- chapter 21 Direct Addressing Data Structure -- chapter 22 Open Addressing Data Structure -- chapter 23 Separate Chaining Data Structure -- chapter 24 Priority Queue ADT -- chapter 25 Binary Heap Data Structure -- chapter 26 Leftist Heap Data Structure -- chapter 27 Pairing Heap Data Structure -- chapter 28 Fibonacci Heap Data Structure -- chapter 29 Ordered Collection ADT -- chapter 30 Sorted Array Data Structure -- chapter 31 Abstract Search Tree Class -- chapter 32 Binary Search Tree Data Structure -- chapter 33 Balanced Binary Search Trees -- chapter 34 Red-Black Tree Data Structure -- chapter 35 Splay Tree Data Structure -- chapter 36 B-Tree Data Structure -- chapter 37 B+-Tree Data Structure -- chapter 38 Skip List Data Structure -- chapter 39 Digitized Ordered Collection ADT -- chapter 40 Trie Node Types -- chapter 41 Trie Data Structure -- chapter 42 Compact Trie Data Structure -- chapter 43 Compressed Trie Data Structure -- chapter 44 Patricia Trie Data Structure -- chapter 45 Ternary Search Trie Data Structure -- chapter 46 Spatial Collection ADT -- chapter 47 KD-Tree Data Structure -- chapter 48 Quad Tree Data Structure -- chapter 49 Tagged Collection ADTs -- chapter 50 Tagged Bucket Collection ADTs -- chapter 3 Part III. GRAPH DATA STRUCTURES AND ALGORITHMS -- chapter 51 Part III Organization -- chapter 52 Graph ADT -- chapter 53 Abstract Graph and Graph Algorithms -- chapter 54 Adjacency Matrix Data Structure -- chapter 55 Adjacency List Data Structure -- chapter 56 Weighted Graph ADT -- chapter 57 Abstract Weighted Graph and Weighted Graph Algorithms -- chapter Part IV. APPENDICES -- chapter A Java Fundamentals -- chapter B Complexity Analysis -- chapter 100 Design Patterns Illustrated in This Book.

Subject Term
Java (Computer program language)
 
Data structures (Computer science)

Added Author
Goldman, Kenneth J. (Kenneth Jerome)

Electronic Access
Click here to view.


LibraryMaterial TypeItem BarcodeShelf Number[[missing key: search.ChildField.HOLDING]]Status
Online LibraryE-Book542071-1001QA76.73 .J38 G589 2008CRC E-Books