<?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>01099    a2200241   4500</leader>
  <controlfield tag="003">Nust</controlfield>
  <controlfield tag="005">20230602194311.0</controlfield>
  <datafield tag="010" ind1=" " ind2=" ">
    <subfield code="a">   95082432</subfield>
  </datafield>
  <datafield tag="020" ind1=" " ind2=" ">
    <subfield code="a">0070278938</subfield>
  </datafield>
  <datafield tag="035" ind1=" " ind2=" ">
    <subfield code="a">(OCoLC)34838899</subfield>
  </datafield>
  <datafield tag="040" ind1=" " ind2=" ">
    <subfield code="c">Nust</subfield>
  </datafield>
  <datafield tag="082" ind1=" " ind2=" ">
    <subfield code="a">005.73,HEI</subfield>
  </datafield>
  <datafield tag="100" ind1="1" ind2=" ">
    <subfield code="a">Heileman, Gregory L.</subfield>
    <subfield code="9">112972</subfield>
  </datafield>
  <datafield tag="245" ind1="1" ind2="0">
    <subfield code="a">Data structures, algorithms, and object-oriented programming /</subfield>
    <subfield code="c">Gregory L. Heileman.</subfield>
  </datafield>
  <datafield tag="260" ind1=" " ind2=" ">
    <subfield code="a">New York :</subfield>
    <subfield code="b">McGraw-Hill,</subfield>
    <subfield code="c">c1996.</subfield>
  </datafield>
  <datafield tag="300" ind1=" " ind2=" ">
    <subfield code="a">xvi, 446 p. :</subfield>
    <subfield code="b">ill. ;</subfield>
    <subfield code="c">24 cm.</subfield>
  </datafield>
  <datafield tag="440" ind1=" " ind2="0">
    <subfield code="a">McGraw-Hill series in computer science.</subfield>
    <subfield code="9">55540</subfield>
  </datafield>
  <datafield tag="505" ind1=" " ind2=" ">
    <subfield code="a">Fundamentals (Page-1), Algorithmic (Page-30), Data Structures And C Programs (Page-60), Object-Oriented Programming In C++, Stacks And Queues (Page-165), Binary Search Trees (Page-190), Hashing (Page- 218), Priority Queues (Page-251), Amortized Analysis (Page-277), Balanced Search Trees (Page-294), Heaps (Page- 324), Dynamic Sets Of Special Operations (Page-346).</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="0">
    <subfield code="a">Computer algorithms.</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="0">
    <subfield code="a">Data structures (Computer science)</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="0">
    <subfield code="a">Object-oriented programming (Computer science)</subfield>
  </datafield>
  <datafield tag="942" ind1=" " ind2=" ">
    <subfield code="2">ddc</subfield>
    <subfield code="c">BK</subfield>
  </datafield>
  <datafield tag="999" ind1=" " ind2=" ">
    <subfield code="c">175256</subfield>
    <subfield code="d">175256</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="a">MCS</subfield>
    <subfield code="b">MCS</subfield>
    <subfield code="c">GEN</subfield>
    <subfield code="d">2016-12-12</subfield>
    <subfield code="o">005.73,HEI</subfield>
    <subfield code="p">MCS26296</subfield>
    <subfield code="r">2016-12-08</subfield>
    <subfield code="w">2016-12-12</subfield>
    <subfield code="y">BK</subfield>
    <subfield code="z">Almirah No.81, Shelf No.2</subfield>
  </datafield>
</record>
