000 02004nam a2200229 i 4500
001 UUN-OA-171
005 20260922220309.0
020 _a9781927356388
100 1 _aPat Morin
245 1 0 _aOpen Data Structures: An Introduction
264 1 _bAthabasca University Press
_c2013
300 _a1 online resource
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
520 _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.
650 4 _aComputer Science
650 4 _aB. Sc. Artificial Intelligence
_2local
540 _aAttribution-NonCommercial-NoDerivs
856 4 0 _uhttps://www.aupress.ca/books/120226-open-data-structures/
_yRead online
856 4 2 _uhttps://open.umn.edu/opentextbooks/textbooks/open-data-structures-an-introduction
_yOpen Textbook Library record
999 _c241
_d241