<?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>01784nam a2200253Ia 4500</leader>
  <controlfield tag="001">28099</controlfield>
  <controlfield tag="005">20260908162414.0</controlfield>
  <controlfield tag="008">250220s9999    xx            000 0 und d</controlfield>
  <datafield tag="020" ind1=" " ind2=" ">
    <subfield code="a">9780470383278</subfield>
  </datafield>
  <datafield tag="040" ind1=" " ind2=" ">
    <subfield code="c">PK-LaUMT</subfield>
  </datafield>
  <datafield tag="082" ind1=" " ind2=" ">
    <subfield code="a">T 005.133</subfield>
    <subfield code="b">GOO-D</subfield>
  </datafield>
  <datafield tag="100" ind1="1" ind2=" ">
    <subfield code="a">Goodrich, Michael T.</subfield>
    <subfield code="9">4645</subfield>
  </datafield>
  <datafield tag="245" ind1="1" ind2="0">
    <subfield code="a">Data structures and algorithms in C++ /</subfield>
    <subfield code="c">Michael T. Goodrich, Roberto Tamassia and David M. Mount</subfield>
  </datafield>
  <datafield tag="250" ind1=" " ind2=" ">
    <subfield code="a">2nd ed.</subfield>
  </datafield>
  <datafield tag="260" ind1=" " ind2=" ">
    <subfield code="a">New York :</subfield>
    <subfield code="b">John Wiley &amp; Sons,</subfield>
    <subfield code="c">2011</subfield>
  </datafield>
  <datafield tag="300" ind1=" " ind2=" ">
    <subfield code="a">xxii, 714 p.</subfield>
  </datafield>
  <datafield tag="500" ind1=" " ind2=" ">
    <subfield code="a">Includes bibliographical references and index.</subfield>
  </datafield>
  <datafield tag="520" ind1=" " ind2=" ">
    <subfield code="a">"An updated, innovative approach to data structures and algorithms Written by an author team of experts in their fields, this authoritative guide demystifies even the most difficult mathematical concepts so that you can gain a clear understanding of data structures and algorithms in C++. The unparalleled author team incorporates the object-oriented design paradigm using C++ as the implementation language, while also providing intuition and analysis of fundamental algorithms. Offers a unique multimedia format for learning the fundamentals of data structures and algorithms Allows you to visualize key analytic concepts, learn about the most recent insights in the field, and do data structure design Provides clear approaches for developing programs Features a clear, easy-to-understand writing style that breaks down even the most difficult mathematical concepts Building on the success of the first edition, this new version offers you an innovative approach to fundamental data structures and algorithms."-- Provided by publisher</subfield>
  </datafield>
  <datafield tag="546" ind1=" " ind2=" ">
    <subfield code="a">Eng</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2=" ">
    <subfield code="a">Computer program language</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
    <subfield code="a">Roberto Tamassia</subfield>
    <subfield code="9">15433</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
    <subfield code="a">Mount, David M.</subfield>
    <subfield code="9">4646</subfield>
  </datafield>
  <datafield tag="942" ind1=" " ind2=" ">
    <subfield code="c">BK</subfield>
  </datafield>
  <datafield tag="999" ind1=" " ind2=" ">
    <subfield code="c">136934</subfield>
    <subfield code="d">136934</subfield>
  </datafield>
  <datafield tag="952" ind1=" " ind2=" ">
    <subfield code="0">0</subfield>
    <subfield code="1">0</subfield>
    <subfield code="4">0</subfield>
    <subfield code="7">0</subfield>
    <subfield code="a">01</subfield>
    <subfield code="b">01</subfield>
    <subfield code="d">2025-02-20</subfield>
    <subfield code="l">13</subfield>
    <subfield code="o"> 005.133 GOO-D</subfield>
    <subfield code="p">148811</subfield>
    <subfield code="q">2026-09-14</subfield>
    <subfield code="r">2026-08-31 20:16:34</subfield>
    <subfield code="s">2026-08-31</subfield>
    <subfield code="w">2025-02-20</subfield>
    <subfield code="y">BK</subfield>
  </datafield>
  <datafield tag="952" ind1=" " ind2=" ">
    <subfield code="0">0</subfield>
    <subfield code="1">0</subfield>
    <subfield code="4">0</subfield>
    <subfield code="7">0</subfield>
    <subfield code="a">01</subfield>
    <subfield code="b">01</subfield>
    <subfield code="d">2026-09-08</subfield>
    <subfield code="l">0</subfield>
    <subfield code="o">005.133 GOO-D</subfield>
    <subfield code="p">154311</subfield>
    <subfield code="r">2026-09-08 12:37:49</subfield>
    <subfield code="t">C.2</subfield>
    <subfield code="w">2026-09-08</subfield>
    <subfield code="y">BK</subfield>
  </datafield>
  <datafield tag="952" ind1=" " ind2=" ">
    <subfield code="0">0</subfield>
    <subfield code="1">0</subfield>
    <subfield code="4">0</subfield>
    <subfield code="7">0</subfield>
    <subfield code="a">01</subfield>
    <subfield code="b">01</subfield>
    <subfield code="d">2026-09-08</subfield>
    <subfield code="l">0</subfield>
    <subfield code="o">005.133 GOO-D</subfield>
    <subfield code="p">154312</subfield>
    <subfield code="r">2026-09-08 12:37:58</subfield>
    <subfield code="t">C.3</subfield>
    <subfield code="w">2026-09-08</subfield>
    <subfield code="y">BK</subfield>
  </datafield>
  <datafield tag="952" ind1=" " ind2=" ">
    <subfield code="0">0</subfield>
    <subfield code="1">0</subfield>
    <subfield code="4">0</subfield>
    <subfield code="7">0</subfield>
    <subfield code="a">01</subfield>
    <subfield code="b">01</subfield>
    <subfield code="d">2026-09-08</subfield>
    <subfield code="l">0</subfield>
    <subfield code="o">005.133 GOO-D</subfield>
    <subfield code="p">154313</subfield>
    <subfield code="r">2026-09-08 12:38:07</subfield>
    <subfield code="t">C.4</subfield>
    <subfield code="w">2026-09-08</subfield>
    <subfield code="y">BK</subfield>
  </datafield>
</record>
