000 03730nam a2200517 i 4500
001 UMUN-OA-20261005-CS-014
003 local
005 20261005174810.0
006 m o d s
007 cr
008 180907s2013 mnu o 0 0 eng d
020 _a9781927356388
035 _a(MnU)OTLid0000171
040 _aMnU
_beng
_cMnU
050 4 _aQA76
100 1 _aMorin, Pat
_eauthor
245 0 0 _aOpen Data Structures
_bAn Introduction
_cPat Morin
264 2 _aMinneapolis, MN
_bOpen Textbook Library
264 1 _a[Place of publication not identified]
_bAthabasca University Press
_c[2013]
264 4 _c©2013.
300 _a1 online resource
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
341 0 _atextual
_bunknown
_2sapdv
490 0 _aOpen textbook library.
500 _aPublication type: Open textbook.
505 0 _a1 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
506 0 _aOpen access; no subscription required for the linked open-access version.
_fUnrestricted online access
_2star
520 0 _aOffered 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.
540 _aAttribution-NonCommercial-NoDerivs (licence family recorded by the source; version not supplied in metadata).
_uhttps://open.umn.edu/opentextbooks/textbooks/171
542 1 _fAttribution-NonCommercial-NoDerivs
546 _aIn English.
588 0 _aDescription based on online resource
590 _aCourse allocation: B. Sc. Computer Science.
650 0 _aComputer Science
_vTextbooks
653 _aB. Sc. Computer Science
653 _aUMUN open access collection
653 _aFoundational textbook
655 4 _aElectronic textbooks.
710 2 _aOpen Textbook Library
_edistributor
856 4 0 _uhttps://www.aupress.ca/books/120226-open-data-structures/
_yRead open-access publication
_zOpen access. Access and licence reported by the source; this host could not be independently checked by automation.
_70
856 4 2 _uhttps://open.umn.edu/opentextbooks/textbooks/171
_yOpen Textbook Library catalogue and formats
_70
884 _aCourse selection and automated MARC21 enrichment from Open Textbook Library metadata.
_g20261005
_khttps://open.umn.edu/opentextbooks/textbooks/171
_qlocal
942 _n0
999 _c376
_d376