<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>01349pamaa2200265   4500</leader>
  <controlfield tag="001">0000049569</controlfield>
  <controlfield tag="005">20121212090000.0</controlfield>
  <controlfield tag="008">110919                             eng  </controlfield>
  <datafield tag="020" ind1="0" ind2="0">
   <subfield code="a">9780470383278 (pbk.) </subfield>
  </datafield>
  <datafield tag="090" ind1="0" ind2="0">
   <subfield code="a">QA76.73.C153 </subfield>
   <subfield code="b">GOO 2011</subfield>
  </datafield>
  <datafield tag="100" ind1="1" ind2="0">
   <subfield code="a">Goodrich </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, David M. Mount.</subfield>
  </datafield>
  <datafield tag="250" ind1="0" ind2="0">
   <subfield code="a">2nd ed.</subfield>
  </datafield>
  <datafield tag="260" ind1="0" ind2="0">
   <subfield code="a">Hoboken, N.J.: </subfield>
   <subfield code="b">Wiley, </subfield>
   <subfield code="c">2011.</subfield>
  </datafield>
  <datafield tag="300" ind1=" " ind2=" ">
   <subfield code="a">xxii, 714 p.: </subfield>
   <subfield code="b">ill.; </subfield>
   <subfield code="c">24 cm.</subfield>
  </datafield>
  <datafield tag="501" ind1="0" ind2="0">
   <subfield code="a">FOEIT</subfield>
  </datafield>
  <datafield tag="504" ind1="0" ind2="0">
   <subfield code="a">Includes bibliographical references and index</subfield>
  </datafield>
  <datafield tag="505" ind1="0" ind2="0">
   <subfield code="a">Machine generated contents note: -- Chapter 1 - Basic C++ Programming. -- Chapter 2 - Object-Oriented Design. -- Chapter 3 - Analysis Tools. -- Chapter 4 - Stacks, Queues, and Recursion. -- Chapter 5 - Vectors, Lists, and Sequences. -- Chapter 6 - Trees. -- Chapter 7 - Priority Queues. -- Chapter 8 - Dictionaries. -- Chapter 9 - Search Trees. -- Chapter 10 - Sorting, Sets, and Selection. -- Chapter 11 - Text Processing. -- Chapter 12 - Graphs. -- Appendix: Useful Mathematical Facts</subfield>
  </datafield>
  <datafield tag="650" ind1="0" ind2="0">
   <subfield code="a">Data structures (Computer science) </subfield>
  </datafield>
  <datafield tag="650" ind1="0" ind2="0">
   <subfield code="a">C++ (Computer program language) </subfield>
  </datafield>
  <datafield tag="650" ind1="0" ind2="0">
   <subfield code="a">Computer algorithms </subfield>
  </datafield>
  <datafield tag="650" ind1="0" ind2="0">
   <subfield code="a">COMPUTERS / Programming Languages / C++ </subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2="1">
   <subfield code="a">Tamassia, </subfield>
   <subfield code="h">Robert </subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2="1">
   <subfield code="a">Mount, </subfield>
   <subfield code="h">David M. </subfield>
  </datafield>
  <datafield tag="901" ind1=" " ind2=" ">
   <subfield code="u">www.wiley.com</subfield>
  </datafield>
 </record>
</collection>
