<?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 a22002057a 4500</leader>
  <datafield tag="999" ind1=" " ind2=" ">
    <subfield code="c">2442</subfield>
    <subfield code="d">2442</subfield>
  </datafield>
  <controlfield tag="003">OSt</controlfield>
  <controlfield tag="005">20200224134323.0</controlfield>
  <controlfield tag="008">200117b           ||||| |||| 00| 0 eng d</controlfield>
  <datafield tag="020" ind1=" " ind2=" ">
    <subfield code="a">978-81-317-0562-9</subfield>
  </datafield>
  <datafield tag="028" ind1=" " ind2=" ">
    <subfield code="b">Allied Informatics, Jaipur</subfield>
    <subfield code="c">7084</subfield>
    <subfield code="d">13/01/2020</subfield>
    <subfield code="q">2019-20</subfield>
  </datafield>
  <datafield tag="040" ind1=" " ind2=" ">
    <subfield code="a">BSDU</subfield>
    <subfield code="b">English</subfield>
    <subfield code="c">BSDU</subfield>
  </datafield>
  <datafield tag="082" ind1=" " ind2=" ">
    <subfield code="a">004.0151</subfield>
    <subfield code="b">DRO</subfield>
  </datafield>
  <datafield tag="100" ind1=" " ind2=" ">
    <subfield code="a">Dromey, R. G.</subfield>
  </datafield>
  <datafield tag="245" ind1=" " ind2=" ">
    <subfield code="a">How to Solve it by Computer</subfield>
  </datafield>
  <datafield tag="260" ind1=" " ind2=" ">
    <subfield code="a">Noida</subfield>
    <subfield code="b">Pearson Education Inc.</subfield>
    <subfield code="c">2011</subfield>
  </datafield>
  <datafield tag="300" ind1=" " ind2=" ">
    <subfield code="a">442</subfield>
  </datafield>
  <datafield tag="504" ind1=" " ind2=" ">
    <subfield code="a">Table of Content
INTRODUCTION TO COMPUTER PROBLEM-SOLVING
FUNDAMENTAL ALGORITHMS
FACTORING METHODS
ARRAY TECHNIQUES
MERGING, SORTING AND SEARCHING
TEXT PROCESSING AND PATTERN SEARCHING
DYNAMICS DATA STRUCTURE ALGORITHMS
RECURSIVE ALGORITHMS</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2=" ">
    <subfield code="a">Computer</subfield>
  </datafield>
  <datafield tag="942" ind1=" " ind2=" ">
    <subfield code="2">ddc</subfield>
    <subfield code="c">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="7">0</subfield>
    <subfield code="a">BSDU</subfield>
    <subfield code="b">BSDU</subfield>
    <subfield code="c">GEN</subfield>
    <subfield code="d">2020-01-17</subfield>
    <subfield code="g">749.00</subfield>
    <subfield code="l">0</subfield>
    <subfield code="o">004.0151 DRO</subfield>
    <subfield code="p">017996</subfield>
    <subfield code="r">2020-02-12 00:00:00</subfield>
    <subfield code="v">749.00</subfield>
    <subfield code="w">2020-01-17</subfield>
    <subfield code="y">BK</subfield>
  </datafield>
</record>
