Open Data Structures An Introduction
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 ap...
Saved in:
Main Author: | |
---|---|
Format: | Electronic eBook |
Language: | English |
Published: |
[Place of publication not identified]
Athabasca University Press
[2013]
|
Series: | Open textbook library.
|
Subjects: | |
Online Access: | Access online version |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
MARC
LEADER | 00000nam a2200000 i 4500 | ||
---|---|---|---|
001 | OTLid0000171 | ||
003 | MnU | ||
005 | 20240122185316.0 | ||
006 | m o d s | ||
007 | cr | ||
008 | 180907s2013 mnu o 0 0 eng d | ||
020 | |a 9781927356388 | ||
040 | |a MnU |b eng |c MnU | ||
050 | 4 | |a QA76 | |
100 | 1 | |a Morin, Pat |e author | |
245 | 0 | 0 | |a Open Data Structures |b An Introduction |c Pat Morin |
264 | 2 | |a Minneapolis, MN |b Open Textbook Library | |
264 | 1 | |a [Place of publication not identified] |b Athabasca University Press |c [2013] | |
264 | 4 | |c ©2013. | |
300 | |a 1 online resource | ||
336 | |a text |b txt |2 rdacontent | ||
337 | |a computer |b c |2 rdamedia | ||
338 | |a online resource |b cr |2 rdacarrier | ||
490 | 0 | |a Open textbook library. | |
505 | 0 | |a 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 | |
520 | 0 | |a 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. | |
542 | 1 | |f Attribution-NonCommercial-NoDerivs | |
546 | |a In English. | ||
588 | 0 | |a Description based on online resource | |
650 | 0 | |a Computer Science |v Textbooks | |
710 | 2 | |a Open Textbook Library |e distributor | |
856 | 4 | 0 | |u https://open.umn.edu/opentextbooks/textbooks/171 |z Access online version |