<?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>02200mam a22003494a 4500</leader>
  <controlfield tag="001">2619846</controlfield>
  <controlfield tag="003">BD-DhUL</controlfield>
  <controlfield tag="005">20140807150054.0</controlfield>
  <controlfield tag="008">990514s2000    ilua     b    001 0 eng  </controlfield>
  <datafield tag="010" ind1=" " ind2=" ">
    <subfield code="a">   99033211 </subfield>
  </datafield>
  <datafield tag="020" ind1=" " ind2=" ">
    <subfield code="a">007109217X (alk. paper)</subfield>
  </datafield>
  <datafield tag="020" ind1=" " ind2=" ">
    <subfield code="a">0071169008</subfield>
  </datafield>
  <datafield tag="035" ind1=" " ind2=" ">
    <subfield code="a">(OCoLC)ocm41412055</subfield>
  </datafield>
  <datafield tag="040" ind1=" " ind2=" ">
    <subfield code="a">DLC</subfield>
    <subfield code="c">DLC</subfield>
    <subfield code="d">OrLoB-B</subfield>
  </datafield>
  <datafield tag="042" ind1=" " ind2=" ">
    <subfield code="a">pcc</subfield>
  </datafield>
  <datafield tag="050" ind1="0" ind2="0">
    <subfield code="a">QA76.73.J38</subfield>
    <subfield code="b">S24 2000</subfield>
  </datafield>
  <datafield tag="082" ind1="0" ind2="0">
    <subfield code="a">005.74</subfield>
    <subfield code="2">21</subfield>
    <subfield code="b">SAD</subfield>
  </datafield>
  <datafield tag="100" ind1="1" ind2=" ">
    <subfield code="a">Sahni, Sartaj.</subfield>
  </datafield>
  <datafield tag="245" ind1="1" ind2="0">
    <subfield code="a">Data structures, algorithms, and applications in Java /</subfield>
    <subfield code="c">Sartaj Sahni.</subfield>
  </datafield>
  <datafield tag="260" ind1=" " ind2=" ">
    <subfield code="a">Boston :</subfield>
    <subfield code="b">McGraw-Hill,</subfield>
    <subfield code="c">c2000.</subfield>
  </datafield>
  <datafield tag="300" ind1=" " ind2=" ">
    <subfield code="a">xxvi, 833 p. :</subfield>
    <subfield code="b">ill. ;</subfield>
    <subfield code="c">24 cm. +</subfield>
    <subfield code="e">1 computer optical disc (4 3/4 in.)</subfield>
  </datafield>
  <datafield tag="365" ind1=" " ind2=" ">
    <subfield code="a">USD</subfield>
    <subfield code="b">24.95</subfield>
  </datafield>
  <datafield tag="504" ind1=" " ind2=" ">
    <subfield code="a">Includes bibliographical references and index.</subfield>
  </datafield>
  <datafield tag="505" ind1="0" ind2="0">
    <subfield code="g">Pt. I.</subfield>
    <subfield code="t">Preliminaries.</subfield>
    <subfield code="g">Ch. 1.</subfield>
    <subfield code="t">Java Review.</subfield>
    <subfield code="g">Ch. 2.</subfield>
    <subfield code="t">Performance Analysis of Programs.</subfield>
    <subfield code="g">Ch. 3.</subfield>
    <subfield code="t">Asymptotic Notation.</subfield>
    <subfield code="g">Ch. 4.</subfield>
    <subfield code="t">Performance Measurement of Programs --</subfield>
    <subfield code="g">Pt. II.</subfield>
    <subfield code="t">Data Structures.</subfield>
    <subfield code="g">Ch. 5.</subfield>
    <subfield code="t">Linear Lists - Array Representation.</subfield>
    <subfield code="g">Ch. 6.</subfield>
    <subfield code="t">Linear Lists - Linked Representation.</subfield>
    <subfield code="g">Ch. 7.</subfield>
    <subfield code="t">Linear Lists - Simulated Pointers.</subfield>
    <subfield code="g">Ch. 8.</subfield>
    <subfield code="t">Arrays and Matrices.</subfield>
    <subfield code="g">Ch. 9.</subfield>
    <subfield code="t">Stacks.</subfield>
    <subfield code="g">Ch. 10.</subfield>
    <subfield code="t">Queues.</subfield>
    <subfield code="g">Ch. 11.</subfield>
    <subfield code="t">Skip Lists and Hashing.</subfield>
    <subfield code="g">Ch. 12.</subfield>
    <subfield code="t">Binary and Other Trees.</subfield>
    <subfield code="g">Ch. 13.</subfield>
    <subfield code="t">Priority Queues.</subfield>
    <subfield code="g">Ch. 14.</subfield>
    <subfield code="t">Tournament Trees.</subfield>
    <subfield code="g">Ch. 15.</subfield>
    <subfield code="t">Binary Search Trees.</subfield>
    <subfield code="g">Ch. 16.</subfield>
    <subfield code="t">Balanced Search Trees.</subfield>
    <subfield code="g">Ch. 17.</subfield>
    <subfield code="t">Graphs --</subfield>
    <subfield code="g">Pt. III.</subfield>
    <subfield code="t">Algorithm-Design Methods.</subfield>
    <subfield code="g">Ch. 18.</subfield>
    <subfield code="t">The Greedy Method.</subfield>
    <subfield code="g">Ch. 19.</subfield>
    <subfield code="t">Divide and Conquer.</subfield>
    <subfield code="g">Ch. 20.</subfield>
    <subfield code="t">Dynamic Programming.</subfield>
    <subfield code="g">Ch. 21.</subfield>
    <subfield code="t">Backtracking (On the Web).</subfield>
    <subfield code="g">Ch. 22.</subfield>
    <subfield code="t">Branch and Bound (On the Web).</subfield>
  </datafield>
  <datafield tag="520" ind1="1" ind2=" ">
    <subfield code="a">"Data Structures, Algorithms, and Applications in Java provides comprehensive coverage of fundamental data structures, making it ideal for use in a CS2 course. Sahni has made this text the most student friendly of all his text-books by using a gentle introduction, providing intuitive discussions, and including real-world applications."--BOOK JACKET.</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="0">
    <subfield code="a">Java (Computer program language)</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">Computer algorithms.</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="0">
    <subfield code="a">Application software</subfield>
    <subfield code="x">Development.</subfield>
  </datafield>
  <datafield tag="900" ind1=" " ind2=" ">
    <subfield code="a">AUTH</subfield>
    <subfield code="b">TOC</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">1160</subfield>
    <subfield code="d">1160</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="6">005_740000000000000_SAD</subfield>
    <subfield code="7">0</subfield>
    <subfield code="8">NFIC</subfield>
    <subfield code="9">1941</subfield>
    <subfield code="a">DUSL</subfield>
    <subfield code="b">DUSL</subfield>
    <subfield code="c">GEN</subfield>
    <subfield code="d">2000-08-07</subfield>
    <subfield code="e">Purchased</subfield>
    <subfield code="o">005.74 SAD</subfield>
    <subfield code="p">391927</subfield>
    <subfield code="r">2014-08-07</subfield>
    <subfield code="t">1</subfield>
    <subfield code="w">2014-08-07</subfield>
    <subfield code="y">BK</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="6">005_740000000000000_SAD</subfield>
    <subfield code="7">0</subfield>
    <subfield code="8">NFIC</subfield>
    <subfield code="9">1946</subfield>
    <subfield code="a">DUSL</subfield>
    <subfield code="b">DUSL</subfield>
    <subfield code="c">GEN</subfield>
    <subfield code="d">2000-08-07</subfield>
    <subfield code="e">Purchased</subfield>
    <subfield code="o">005.74 SAD</subfield>
    <subfield code="p">391928</subfield>
    <subfield code="r">2014-08-07</subfield>
    <subfield code="t">2</subfield>
    <subfield code="w">2014-08-07</subfield>
    <subfield code="y">BK</subfield>
  </datafield>
</record>
