Open Data Structures: An Introduction (Record no. 48569)

MARC details
000 -LEADER
fixed length control field 02244naaaa2200277uu 4500
001 - CONTROL NUMBER
control field https://directory.doabooks.org/handle/20.500.12854/55265
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20220219224000.0
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9781927356388
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9781927356395
041 0# - LANGUAGE CODE
Language code of text/sound track or separate title English
042 ## - AUTHENTICATION CODE
Authentication code dc
100 1# - MAIN ENTRY--PERSONAL NAME
Personal name Pat Morin
Relationship auth
245 10 - TITLE STATEMENT
Title Open Data Structures: An Introduction
260 ## - PUBLICATION, DISTRIBUTION, ETC.
Name of publisher, distributor, etc. Athabasca University Press
Date of publication, distribution, etc. 2013
300 ## - PHYSICAL DESCRIPTION
Extent 1 electronic resource (336 p.)
506 0# - RESTRICTIONS ON ACCESS NOTE
Terms governing access Open Access
Source of term star
Standardized terminology for access restriction Unrestricted online access
520 ## - SUMMARY, ETC.
Summary, etc. 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.
540 ## - TERMS GOVERNING USE AND REPRODUCTION NOTE
Terms governing use and reproduction Creative Commons
Use and reproduction rights https://creativecommons.org/licenses/by-nc-nd/4.0/
Source of term cc
-- https://creativecommons.org/licenses/by-nc-nd/4.0/
546 ## - LANGUAGE NOTE
Language note English
653 ## - INDEX TERM--UNCONTROLLED
Uncontrolled term algorithms
653 ## - INDEX TERM--UNCONTROLLED
Uncontrolled term java
653 ## - INDEX TERM--UNCONTROLLED
Uncontrolled term data structures
653 ## - INDEX TERM--UNCONTROLLED
Uncontrolled term programming
856 40 - ELECTRONIC LOCATION AND ACCESS
Host name www.oapen.org
Uniform Resource Identifier <a href="http://www.aupress.ca/index.php/books/120226">http://www.aupress.ca/index.php/books/120226</a>
Access status 0
Public note DOAB: download the publication
856 40 - ELECTRONIC LOCATION AND ACCESS
Host name www.oapen.org
Uniform Resource Identifier <a href="https://directory.doabooks.org/handle/20.500.12854/55265">https://directory.doabooks.org/handle/20.500.12854/55265</a>
Access status 0
Public note DOAB: description of the publication

No items available.