MARC details
| 000 -LEADER |
|---|
| fixed length control field |
02616nam a2200349 4500 |
| 001 - CONTROL NUMBER |
|---|
| control field |
OTLid0000171 |
| 003 - CONTROL NUMBER IDENTIFIER |
|---|
| control field |
MnU |
| 005 - DATE AND TIME OF LATEST TRANSACTION |
|---|
| control field |
20201105133301.0 |
| 006 - FIXED-LENGTH DATA ELEMENTS--ADDITIONAL MATERIAL CHARACTERISTICS |
|---|
| fixed length control field |
m o d s |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION |
|---|
| fixed length control field |
180907s2013 mnu o 0 0 eng d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
|---|
| International Standard Book Number |
9781927356388 |
| 040 ## - CATALOGING SOURCE |
|---|
| Original cataloging agency |
MnU |
| Language of cataloging |
eng |
| Transcribing agency |
MnU |
| 050 #4 - LIBRARY OF CONGRESS CALL NUMBER |
|---|
| Classification number |
QA76 |
| 100 1# - MAIN ENTRY--PERSONAL NAME |
|---|
| Personal name |
Morin, Pat |
| Relator term |
author |
| 245 00 - TITLE STATEMENT |
|---|
| Title |
Open Data Structures |
| Remainder of title |
An Introduction |
| Statement of responsibility, etc. |
Pat Morin |
| 264 #2 - PRODUCTION, PUBLICATION, DISTRIBUTION, MANUFACTURE, AND COPYRIGHT NOTICE |
|---|
| Name of producer, publisher, distributor, manufacturer |
Open Textbook Library |
| 264 #1 - PRODUCTION, PUBLICATION, DISTRIBUTION, MANUFACTURE, AND COPYRIGHT NOTICE |
|---|
| Name of producer, publisher, distributor, manufacturer |
Athabasca University Press |
| 300 ## - PHYSICAL DESCRIPTION |
|---|
| Extent |
1 online resource |
| 490 0# - SERIES STATEMENT |
|---|
| Series statement |
Open textbook library. |
| 505 0# - FORMATTED CONTENTS NOTE |
|---|
| Formatted contents note |
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# - 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. |
| 542 1# - INFORMATION RELATING TO COPYRIGHT STATUS |
|---|
| Copyright statement |
Attribution-NonCommercial-NoDerivs |
| 546 ## - LANGUAGE NOTE |
|---|
| Language note |
In English. |
| 588 0# - SOURCE OF DESCRIPTION NOTE |
|---|
| Source of description note |
Description based on online resource |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name entry element |
Computer Science |
| Form subdivision |
Textbooks |
| 710 2# - ADDED ENTRY--CORPORATE NAME |
|---|
| Corporate name or jurisdiction name as entry element |
Open Textbook Library |
| Relator term |
distributor |
| 856 40 - ELECTRONIC LOCATION AND ACCESS |
|---|
| Uniform Resource Identifier |
<a href="https://open.umn.edu/opentextbooks/textbooks/171">https://open.umn.edu/opentextbooks/textbooks/171</a> |
| Public note |
Access online version |
