<?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>00781nam a2200229Ia 4500</leader>
  <controlfield tag="003">OSt</controlfield>
  <controlfield tag="005">20240926104618.0</controlfield>
  <controlfield tag="008">210716s2004    xx            000 0 und d</controlfield>
  <datafield tag="020" ind1=" " ind2=" ">
    <subfield code="a">9788126562923</subfield>
  </datafield>
  <datafield tag="040" ind1=" " ind2=" ">
    <subfield code="c">AIMIT LIBRARY</subfield>
  </datafield>
  <datafield tag="041" ind1=" " ind2=" ">
    <subfield code="a">eng</subfield>
  </datafield>
  <datafield tag="082" ind1=" " ind2=" ">
    <subfield code="a">005.73 </subfield>
    <subfield code="2">GOOM</subfield>
  </datafield>
  <datafield tag="100" ind1=" " ind2=" ">
    <subfield code="a">Goodrich, Michael T.</subfield>
    <subfield code="9">180245</subfield>
  </datafield>
  <datafield tag="245" ind1=" " ind2=" ">
    <subfield code="a">Data structures and algorithms in c++ /</subfield>
    <subfield code="c">By Michael T. Goodrich; Roberto Tamassis 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 Delhi :</subfield>
    <subfield code="b">Wiley India Pvt Ltd ,</subfield>
    <subfield code="c">2004.</subfield>
  </datafield>
  <datafield tag="300" ind1=" " ind2=" ">
    <subfield code="a">xxii,714 p.;</subfield>
    <subfield code="b">PB</subfield>
    <subfield code="c">24.5 cm.</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2=" ">
    <subfield code="a">Basic c++ programming elements</subfield>
    <subfield code="9">180246</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2=" ">
    <subfield code="a">Goals principles and patternsArrays linked lists and recursion</subfield>
    <subfield code="9">180247</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2=" ">
    <subfield code="a">Stacks queues and deques</subfield>
    <subfield code="9">180248</subfield>
  </datafield>
  <datafield tag="942" ind1=" " ind2=" ">
    <subfield code="2">ddc</subfield>
    <subfield code="c">BK</subfield>
    <subfield code="k">005.73 GOOM</subfield>
  </datafield>
  <datafield tag="999" ind1=" " ind2=" ">
    <subfield code="c">195747</subfield>
    <subfield code="d">195747</subfield>
  </datafield>
  <datafield tag="952" ind1=" " ind2=" ">
    <subfield code="0">0</subfield>
    <subfield code="1">0</subfield>
    <subfield code="2">ddc</subfield>
    <subfield code="4">0</subfield>
    <subfield code="7">0</subfield>
    <subfield code="8">MCA</subfield>
    <subfield code="a">AIMIT</subfield>
    <subfield code="b">AIMIT</subfield>
    <subfield code="d">2017-03-08</subfield>
    <subfield code="e">Knowledge World</subfield>
    <subfield code="g">669.00</subfield>
    <subfield code="i">Bill no:335; Billdt:2017-02-28</subfield>
    <subfield code="l">4</subfield>
    <subfield code="o">005.73 GOOM</subfield>
    <subfield code="p">MCA15258</subfield>
    <subfield code="r">2026-05-23 00:00:00</subfield>
    <subfield code="s">2025-09-10</subfield>
    <subfield code="v">521.82</subfield>
    <subfield code="w">2021-07-16</subfield>
    <subfield code="y">BK</subfield>
  </datafield>
</record>
