Open Data Structures An Introduction Pat Morin

By: Contributor(s): Material type: TextSeries: Open textbook libraryDistributor: Minneapolis, MN Open Textbook LibraryPublisher: [Place of publication not identified] Athabasca University Press [2013]Copyright date: ©2013Description: 1 online resourceContent type:
  • text
Media type:
  • computer
Carrier type:
  • online resource
ISBN:
  • 9781927356388
Subject(s): Genre/Form: LOC classification:
  • QA76
Contents:
1 Introduction -- 2 Array-Based Lists -- 3 Linked Lists -- 4 Skiplists -- 5 Hash Tables -- 6 Binary Trees -- 7 Random Binary Search Trees -- 8 Scapegoat Trees -- 9 Red-Black Trees -- 10 Heaps -- 11 Sorting Algorithms -- 12 Graphs -- 13 Data Structures for Integers -- 14 External Memory Searching
Subject: 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. Analyzed and implemented in Java, the data structures presented in the book include stacks, queues, deques, and lists implemented as arrays and linked-lists; space-efficient implementations of lists; skip lists; hash tables and hash codes; binary search trees including treaps, scapegoat trees, and red-black trees; integer searching structures including binary tries, x-fast tries, and y-fast tries; heaps, including implicit binary heaps and randomized meldable heaps; graphs, including adjacency matrix and adjacency list representations; and B-trees. A modern treatment of an essential computer science topic, Open Data Structures is a measured balance between classical topics and state-of-the art structures that will serve the needs of all undergraduate students or self-directed learners.
List(s) this item appears in: Open Access Resources
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
No physical items for this record

Publication type: Open textbook.

1 Introduction -- 2 Array-Based Lists -- 3 Linked Lists -- 4 Skiplists -- 5 Hash Tables -- 6 Binary Trees -- 7 Random Binary Search Trees -- 8 Scapegoat Trees -- 9 Red-Black Trees -- 10 Heaps -- 11 Sorting Algorithms -- 12 Graphs -- 13 Data Structures for Integers -- 14 External Memory Searching

Open access; no subscription required for the linked open-access version. Unrestricted online access star

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. Analyzed and implemented in Java, the data structures presented in the book include stacks, queues, deques, and lists implemented as arrays and linked-lists; space-efficient implementations of lists; skip lists; hash tables and hash codes; binary search trees including treaps, scapegoat trees, and red-black trees; integer searching structures including binary tries, x-fast tries, and y-fast tries; heaps, including implicit binary heaps and randomized meldable heaps; graphs, including adjacency matrix and adjacency list representations; and B-trees. A modern treatment of an essential computer science topic, Open Data Structures is a measured balance between classical topics and state-of-the art structures that will serve the needs of all undergraduate students or self-directed learners.

Attribution-NonCommercial-NoDerivs (licence family recorded by the source; version not supplied in metadata).

https://open.umn.edu/opentextbooks/textbooks/171

Attribution-NonCommercial-NoDerivs

In English.

Description based on online resource

Course allocation: B. Sc. Computer Science.

There are no comments on this title.

to post a comment.