Open Data Structures
Home > Society and Social Sciences > Education > Educational equipment and technology, computer-aided learning (CAL) > Open Data Structures: An Introduction(OPEL: Open Paths to Enriched Learning)
Open Data Structures: An Introduction(OPEL: Open Paths to Enriched Learning)

Open Data Structures: An Introduction(OPEL: Open Paths to Enriched Learning)


     0     
5
4
3
2
1



International Edition


X
About the Book

Offered as an introduction to the field of data structures andalgorithms, Open Data Structures covers the implementation andanalysis of data structures for sequences (lists), queues, priorityqueues, unordered dictionaries, ordered dictionaries, and graphs.Focusing on a mathematically rigorous approach that is fast, practical,and efficient, Morin clearly and briskly presents instruction alongwith source code. Analyzed and implemented in Java, the data structures presented inthe book include stacks, queues, deques, and lists implemented asarrays and linked-lists; space-efficient implementations of lists; skiplists; hash tables and hash codes; binary search trees includingtreaps, scapegoat trees, and red-black trees; integer searchingstructures including binary tries, x-fast tries, and y-fast tries;heaps, including implicit binary heaps and randomized meldable heaps;and graphs, including adjacency matrix and adjacency listrepresentations; and B-trees. A modern treatment of an essential computer science topic, OpenData Structures is a measured balance between classical topics andstate-of-the art structures that will serve the needs of allundergraduate students or self-directed learners.

Table of Contents:
Acknowledgments- xi Why This Book?- xiii 1. 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- 26 2. Array-Based Lists- 29 2.1 ArrayStack: Fast Stack Operations Using an Array- 30 2.2 FastArrayStack: An Optimized ArrayStack- 35 2.3 ArrayQueue: An Array-Based Queue- 36 2.4 ArrayDeque: Fast Deque Operations Using an Array- 40 2.5 DualArrayDeque: Building a Deque from Two Stacks- 43 2.6 RootishArrayStack: A Space-Efficient Array Stack- 49 2.7 Discussion and Exercises- 59 3. 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- 82 4. 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- 102 5. 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- 128 6. 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- 147 7. 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- 168 8. Scapegoat Trees- 173 8.1 ScapegoatTree: A Binary Search Tree with Partial Rebuilding-173 8.2 Discussion and Exercises- 181 9. 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- 206 10. Heaps- 211 10.1 BinaryHeap: An Implicit Binary Tree- 211 10.2 MeldableHeap: A Randomized Meldable Heap- 217 10.3 Discussion and Exercises- 222 11. Sorting Algorithms- 225 11.1 Comparison-Based Sorting- 226 11.2 Counting Sort and Radix Sort- 238 11.3 Discussion and Exercises- 243 12. 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- 261 13. 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- 280 14. External Memory Searching- 283 14.1 The Block Store- 285 14.2 B-Trees- 285 14.3 Discussion and Exercises- 304 Bibliography- 309 Index- 317

About the Author :
Pat Morin is Professor in the School of ComputerScience at Carleton University as well as founder and managing editorof the open access Journal of Computational Geometry. He is the authorof numerous conference papers and journal publications on the topics ofcomputational geometry, algorithms, and data structures.


Best Sellers


Product Details
  • ISBN-13: 9781927356388
  • Publisher: Au Press
  • Publisher Imprint: Au Press
  • Height: 229 mm
  • No of Pages: 344
  • Sub Title: An Introduction
  • Width: 152 mm
  • ISBN-10: 1927356385
  • Publisher Date: 01 Jun 2013
  • Binding: Paperback
  • Language: English
  • Series Title: OPEL: Open Paths to Enriched Learning
  • Weight: 540 gr


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Open Data Structures: An Introduction(OPEL: Open Paths to Enriched Learning)
Au Press -
Open Data Structures: An Introduction(OPEL: Open Paths to Enriched Learning)
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Open Data Structures: An Introduction(OPEL: Open Paths to Enriched Learning)

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    New Arrivals


    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!