Open Data Structures. (eBook, 2013) [WorldCat.org]
skip to content
Open Data Structures.
Checking...

Open Data Structures.

Author: Pat Morin; Cantook Station,
Publisher: Athabasca University Press 2013-08-01.
Edition/Format:   eBook : Document : English
Summary:
Offered as an introduction to the field of data structures and algorithms, Open Data Structures covers the implementation and analysis of data structures for sequences (lists), queues, priority queues, unordered dictionaries, ordered dictionaries, and graphs. Focusing on a mathematically rigorous approach that is fast, practical, and efficient, Morin clearly and briskly presents instruction along with source code.  Read more...
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Material Type: Document, Internet resource
Document Type: Internet Resource, Computer File
All Authors / Contributors: Pat Morin; Cantook Station,
ISBN: 9781927356388 1927356385
OCLC Number: 1012925846
Description: 1 online resource
Contents: Acknowledgments- xiWhy This Book?- xiii1. Introduction- 1 1.1 The Need for Efficiency- 2 1.2 Interfaces- 4 1.3 Mathematical Background- 9 1.4 The Model of Computation- 18 1.5 Correctness, Time Complexity, and Space Complexity- 19 1.6 Code Samples- 22 1.7 List of Data Structures- 22 1.8 Discussion and Exercises- 262. Array-Based Lists- 29 2.1 ArrayStack: Fast Stack Operations Using an Array- 302.2 FastArrayStack: An Optimized ArrayStack- 352.3 ArrayQueue: An Array-Based Queue- 362.4 ArrayDeque: Fast Deque Operations Using an Array- 402.5 DualArrayDeque: Building a Deque from Two Stacks- 432.6 RootishArrayStack: A Space-Efficient Array Stack- 492.7 Discussion and Exercises- 593. Linked Lists- 63 3.1 SLList: A Singly-Linked List- 63 3.2 DLList: A Doubly-Linked List- 67 3.3 SEList: A Space-Efficient Linked List- 71 3.4 Discussion and Exercises- 824. Skiplists- 87 4.1 The Basic Structure- 87 4.2 SkiplistSSet: An Efficient Sset- 90 4.3 SkiplistList: An Efficient Random-Access List- 93 4.4 Analysis of Skiplists- 98 4.5 Discussion and Exercises- 1025. Hash Tables- 107 5.1 ChainedHashTable: Hashing with Chaining- 107 5.2 LinearHashTable: Linear Probing- 114 5.3 Hash Codes- 122 5.4 Discussion and Exercises- 1286. Binary Trees- 133 6.1 BinaryTree: A Basic Binary Tree- 135 6.2 BinarySearchTree: An Unbalanced Binary Search Tree- 140 6.3 Discussion and Exercises- 1477. Random Binary Search Trees- 153 7.1 Random Binary Search Trees- 153 7.2 Treap: A Randomized Binary Search Tree- 159 7.3 Discussion and Exercises- 1688. Scapegoat Trees- 173 8.1 ScapegoatTree: A Binary Search Tree with Partial Rebuilding-173 8.2 Discussion and Exercises- 1819. Red-Black Trees- 185 9.1 2-4 Trees- 186 9.2 RedBlackTree: A Simulated 2-4 Tree- 190 9.3 Summary- 205 9.4 Discussion and Exercises- 20610. Heaps- 211 10.1 BinaryHeap: An Implicit Binary Tree- 211 10.2 MeldableHeap: A Randomized Meldable Heap- 217 10.3 Discussion and Exercises- 22211. Sorting Algorithms- 225 11.1 Comparison-Based Sorting- 226 11.2 Counting Sort and Radix Sort- 238 11.3 Discussion and Exercises- 24312. Graphs- 247 12.1 AdjacencyMatrix: Representing a Graph by a Matrix- 249 12.2 AdjacencyLists: A Graph as a Collection of Lists- 252 12.3 Graph Traversal- 256 12.4 Discussion and Exercises- 26113. Data Structures for Integers- 265 13.1 BinaryTrie: A digital search tree- 266 13.2 XFastTrie: Searching in Doubly-Logarithmic Time- 272 13.3 YFastTrie: A Doubly-Logarithmic Time SSet- 275 13.4 Discussion and Exercises- 28014. External Memory Searching- 283 14.1 The Block Store- 285 14.2 B-Trees- 285 14.3 Discussion and Exercises- 304Bibliography- 309Index- 317
More information:

Abstract:

An introduction to the field of data structures and algorithms.  Read more...

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.

Similar Items

Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.