<?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>02082cam a22003015a 4500</leader>
  <controlfield tag="001">19024409</controlfield>
  <controlfield tag="005">20160811112008.0</controlfield>
  <controlfield tag="008">160321s2015    ii a   frb    001 0 eng d</controlfield>
  <datafield tag="010" ind1=" " ind2=" ">
    <subfield code="a">  2016304653</subfield>
  </datafield>
  <datafield tag="020" ind1=" " ind2=" ">
    <subfield code="a">9780199456666</subfield>
  </datafield>
  <datafield tag="020" ind1=" " ind2=" ">
    <subfield code="a">0199456666</subfield>
  </datafield>
  <datafield tag="040" ind1=" " ind2=" ">
    <subfield code="a">DLC</subfield>
    <subfield code="b">eng</subfield>
    <subfield code="c">DLC</subfield>
    <subfield code="d">EG-ScBUE </subfield>
  </datafield>
  <datafield tag="042" ind1=" " ind2=" ">
    <subfield code="a">pcc</subfield>
  </datafield>
  <datafield tag="082" ind1="0" ind2="4">
    <subfield code="2">22</subfield>
    <subfield code="a">005.1</subfield>
    <subfield code="b">BHA</subfield>
  </datafield>
  <datafield tag="100" ind1="1" ind2=" ">
    <subfield code="a">Bhasin, Harsh&#x200F;.</subfield>
    <subfield code="9">40730</subfield>
  </datafield>
  <datafield tag="245" ind1="1" ind2="0">
    <subfield code="a">Algorithms :</subfield>
    <subfield code="b">design and analysis /</subfield>
    <subfield code="c">Harsh Bhasin.</subfield>
  </datafield>
  <datafield tag="260" ind1=" " ind2=" ">
    <subfield code="a">New Delhi :</subfield>
    <subfield code="b">Oxford University Press,</subfield>
    <subfield code="c">2015.</subfield>
  </datafield>
  <datafield tag="300" ind1=" " ind2=" ">
    <subfield code="a">690 p. :</subfield>
    <subfield code="b">ill. ;</subfield>
    <subfield code="c">25 cm.</subfield>
  </datafield>
  <datafield tag="500" ind1=" " ind2=" ">
    <subfield code="a">Index : p.685-690.</subfield>
  </datafield>
  <datafield tag="504" ind1=" " ind2=" ">
    <subfield code="a">Bibliography : p. 681-684.</subfield>
  </datafield>
  <datafield tag="505" ind1=" " ind2=" ">
    <subfield code="a">CHAPTER 1 INTRODUCTION TO ALGORITHMS -- CHAPTER 2 GROWTH OF FUNCTIONS -- CHAPTER 3 RECURSION -- CHAPTER 4 ANALYSIS OF ALGORITHMS -- CHAPTER 5 BASIC DATA STRUCTURES -- CHAPTER 6 TREES -- CHAPTER 7 GRAPHS -- CHAPTER 8 SORTING IN LINEAR AND QUADRATIC TIME -- CHAPTER 9 DIVIDE AND CONQUER -- CHAPTER 10 GREEDY ALGORITHMS -- CHAPTER 11 DYNAMIC PROGRAMMING -- CHAPTER12 BACKTRACKING -- CHAPTER 13 BRANCH AND BOUND -- CHAPTER 14 RANDOMIZED ALGORITHMS -- CHAPTER 15 TRANSFORM AND CONQUER -- CHAPTER 16 DECREASE AND CONQUER -- CHAPTER 17 NUMBER THEORETIC ALGORITHMS -- CHAPTER 18 STRING MATCHING -- CHAPTER 19 COMPLEXITY CLASSES -- CHAPTER 20 AN INTRODUCTION TO PSPACE -- CHAPTER 21 APPROXIMATION ALGORITHMS -- CHAPTER 22 PARALLEL ALGORITHMS -- CHAPTER 23 AN INTRODUCTION TO MACHINE LEARNING APPROACHES ; CHAPTER 24 COMPUTATIONAL BIOLOGY AND BIOINFORMATICS.</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="7">
    <subfield code="a">Computer algorithms.</subfield>
    <subfield code="2">BUEsh</subfield>
    <subfield code="9">10553</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="7">
    <subfield code="a">Computer algorithms </subfield>
    <subfield code="x">Design.</subfield>
    <subfield code="2">BUEsh</subfield>
    <subfield code="9">40731</subfield>
  </datafield>
  <datafield tag="651" ind1=" " ind2=" ">
    <subfield code="2">BUEsh</subfield>
  </datafield>
  <datafield tag="653" ind1=" " ind2=" ">
    <subfield code="b">ENGGEN</subfield>
    <subfield code="c">August 2016	</subfield>
  </datafield>
  <datafield tag="856" ind1=" " ind2=" ">
    <subfield code="u">https://india.oup.com/orcs/9780199456666/</subfield>
    <subfield code="y">Online resources for teachers and students</subfield>
    <subfield code="z">For faculty: chapter-wise PowerPoint slides, solution manual for select chapter-end problems, assignment questions with answers -- for students: additional MCQs for test generator with answers for each chapter, C language implementaion of algorithms, interview questions with answers.</subfield>
  </datafield>
  <datafield tag="942" ind1=" " ind2=" ">
    <subfield code="2">ddc</subfield>
    <subfield code="e">22</subfield>
    <subfield code="k">005.1 BHA</subfield>
  </datafield>
  <datafield tag="999" ind1=" " ind2=" ">
    <subfield code="c">22164</subfield>
    <subfield code="d">22136</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">Baccah</subfield>
    <subfield code="a">MAIN</subfield>
    <subfield code="b">MAIN</subfield>
    <subfield code="c">LOW</subfield>
    <subfield code="d">2016-08-11</subfield>
    <subfield code="e">Purchase</subfield>
    <subfield code="g">285.00</subfield>
    <subfield code="h">25844</subfield>
    <subfield code="l">2</subfield>
    <subfield code="m">1</subfield>
    <subfield code="o">005.1 BHA</subfield>
    <subfield code="p">000033208</subfield>
    <subfield code="r">2025-07-15 00:00:00</subfield>
    <subfield code="s">2024-05-25</subfield>
    <subfield code="v">356.25</subfield>
    <subfield code="y">BB</subfield>
  </datafield>
</record>
