<?xml version="1.0" encoding="UTF-8"?>
<record
    xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
    xsi:schemaLocation="http://www.loc.gov/MARC21/slim http://www.loc.gov/standards/marcxml/schema/MARC21slim.xsd"
    xmlns="http://www.loc.gov/MARC21/slim">

  <leader>03730nam a2200517 i 4500</leader>
  <controlfield tag="001">UMUN-OA-20261005-CS-014</controlfield>
  <controlfield tag="003">local</controlfield>
  <controlfield tag="005">20261005174810.0</controlfield>
  <controlfield tag="006">m     o  d s      </controlfield>
  <controlfield tag="007">cr            </controlfield>
  <controlfield tag="008">180907s2013    mnu     o     0   0 eng d</controlfield>
  <datafield tag="020" ind1=" " ind2=" ">
    <subfield code="a">9781927356388</subfield>
  </datafield>
  <datafield tag="035" ind1=" " ind2=" ">
    <subfield code="a">(MnU)OTLid0000171</subfield>
  </datafield>
  <datafield tag="040" ind1=" " ind2=" ">
    <subfield code="a">MnU</subfield>
    <subfield code="b">eng</subfield>
    <subfield code="c">MnU</subfield>
  </datafield>
  <datafield tag="050" ind1=" " ind2="4">
    <subfield code="a">QA76</subfield>
  </datafield>
  <datafield tag="100" ind1="1" ind2=" ">
    <subfield code="a">Morin, Pat</subfield>
    <subfield code="e">author</subfield>
  </datafield>
  <datafield tag="245" ind1="0" ind2="0">
    <subfield code="a">Open Data Structures</subfield>
    <subfield code="b">An Introduction</subfield>
    <subfield code="c">Pat Morin</subfield>
  </datafield>
  <datafield tag="264" ind1=" " ind2="2">
    <subfield code="a">Minneapolis, MN</subfield>
    <subfield code="b">Open Textbook Library</subfield>
  </datafield>
  <datafield tag="264" ind1=" " ind2="1">
    <subfield code="a">[Place of publication not identified]</subfield>
    <subfield code="b">Athabasca University Press</subfield>
    <subfield code="c">[2013]</subfield>
  </datafield>
  <datafield tag="264" ind1=" " ind2="4">
    <subfield code="c">&#xA9;2013.</subfield>
  </datafield>
  <datafield tag="300" ind1=" " ind2=" ">
    <subfield code="a">1 online resource</subfield>
  </datafield>
  <datafield tag="336" ind1=" " ind2=" ">
    <subfield code="a">text</subfield>
    <subfield code="b">txt</subfield>
    <subfield code="2">rdacontent</subfield>
  </datafield>
  <datafield tag="337" ind1=" " ind2=" ">
    <subfield code="a">computer</subfield>
    <subfield code="b">c</subfield>
    <subfield code="2">rdamedia</subfield>
  </datafield>
  <datafield tag="338" ind1=" " ind2=" ">
    <subfield code="a">online resource</subfield>
    <subfield code="b">cr</subfield>
    <subfield code="2">rdacarrier</subfield>
  </datafield>
  <datafield tag="341" ind1="0" ind2=" ">
    <subfield code="a">textual</subfield>
    <subfield code="b">unknown</subfield>
    <subfield code="2">sapdv</subfield>
  </datafield>
  <datafield tag="490" ind1="0" ind2=" ">
    <subfield code="a">Open textbook library.</subfield>
  </datafield>
  <datafield tag="500" ind1=" " ind2=" ">
    <subfield code="a">Publication type: Open textbook.</subfield>
  </datafield>
  <datafield tag="505" ind1="0" ind2=" ">
    <subfield code="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</subfield>
  </datafield>
  <datafield tag="506" ind1="0" ind2=" ">
    <subfield code="a">Open access; no subscription required for the linked open-access version.</subfield>
    <subfield code="f">Unrestricted online access</subfield>
    <subfield code="2">star</subfield>
  </datafield>
  <datafield tag="520" ind1="0" ind2=" ">
    <subfield code="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.</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
    <subfield code="a">Attribution-NonCommercial-NoDerivs (licence family recorded by the source; version not supplied in metadata).</subfield>
    <subfield code="u">https://open.umn.edu/opentextbooks/textbooks/171</subfield>
  </datafield>
  <datafield tag="542" ind1="1" ind2=" ">
    <subfield code="f">Attribution-NonCommercial-NoDerivs</subfield>
  </datafield>
  <datafield tag="546" ind1=" " ind2=" ">
    <subfield code="a">In English.</subfield>
  </datafield>
  <datafield tag="588" ind1="0" ind2=" ">
    <subfield code="a">Description based on online resource</subfield>
  </datafield>
  <datafield tag="590" ind1=" " ind2=" ">
    <subfield code="a">Course allocation: B. Sc. Computer Science.</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="0">
    <subfield code="a">Computer Science</subfield>
    <subfield code="v">Textbooks</subfield>
  </datafield>
  <datafield tag="653" ind1=" " ind2=" ">
    <subfield code="a">B. Sc. Computer Science</subfield>
  </datafield>
  <datafield tag="653" ind1=" " ind2=" ">
    <subfield code="a">UMUN open access collection</subfield>
  </datafield>
  <datafield tag="653" ind1=" " ind2=" ">
    <subfield code="a">Foundational textbook</subfield>
  </datafield>
  <datafield tag="655" ind1=" " ind2="4">
    <subfield code="a">Electronic textbooks.</subfield>
  </datafield>
  <datafield tag="710" ind1="2" ind2=" ">
    <subfield code="a">Open Textbook Library</subfield>
    <subfield code="e">distributor</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2="0">
    <subfield code="u">https://www.aupress.ca/books/120226-open-data-structures/</subfield>
    <subfield code="y">Read open-access publication</subfield>
    <subfield code="z">Open access. Access and licence reported by the source; this host could not be independently checked by automation.</subfield>
    <subfield code="7">0</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2="2">
    <subfield code="u">https://open.umn.edu/opentextbooks/textbooks/171</subfield>
    <subfield code="y">Open Textbook Library catalogue and formats</subfield>
    <subfield code="7">0</subfield>
  </datafield>
  <datafield tag="884" ind1=" " ind2=" ">
    <subfield code="a">Course selection and automated MARC21 enrichment from Open Textbook Library metadata.</subfield>
    <subfield code="g">20261005</subfield>
    <subfield code="k">https://open.umn.edu/opentextbooks/textbooks/171</subfield>
    <subfield code="q">local</subfield>
  </datafield>
  <datafield tag="942" ind1=" " ind2=" ">
    <subfield code="n">0</subfield>
  </datafield>
  <datafield tag="999" ind1=" " ind2=" ">
    <subfield code="c">376</subfield>
    <subfield code="d">376</subfield>
  </datafield>
</record>
