<?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>01262nam a22002057a 4500</leader>
  <controlfield tag="005">20251121153033.0</controlfield>
  <datafield tag="020" ind1=" " ind2=" ">
    <subfield code="a">978-9354247866</subfield>
  </datafield>
  <datafield tag="082" ind1=" " ind2=" ">
    <subfield code="a">005.73 GOO</subfield>
  </datafield>
  <datafield tag="100" ind1=" " ind2=" ">
    <subfield code="a">Michael T Goodrich</subfield>
    <subfield code="9">1117</subfield>
  </datafield>
  <datafield tag="100" ind1=" " ind2=" ">
    <subfield code="a">Roberto Tamassia</subfield>
    <subfield code="9">1118</subfield>
  </datafield>
  <datafield tag="100" ind1=" " ind2=" ">
    <subfield code="a">Michael H Goldwasser</subfield>
    <subfield code="9">1119</subfield>
  </datafield>
  <datafield tag="100" ind1=" " ind2=" ">
    <subfield code="a">Subhrakanta Panda</subfield>
    <subfield code="9">1120</subfield>
  </datafield>
  <datafield tag="245" ind1=" " ind2=" ">
    <subfield code="a">Data Structures and Algorithms in Python :An India Adaptation</subfield>
  </datafield>
  <datafield tag="250" ind1=" " ind2=" ">
    <subfield code="a">1</subfield>
  </datafield>
  <datafield tag="260" ind1=" " ind2=" ">
    <subfield code="a">Wiley</subfield>
    <subfield code="b">New Delhi</subfield>
    <subfield code="c">2025</subfield>
  </datafield>
  <datafield tag="520" ind1=" " ind2=" ">
    <subfield code="a">Data Structures and Algorithms in Python offers a comprehensive, definitive introduction to data structures and algorithms, including their design, analysis, and implementation in Python. Utilizing a consistent object-oriented viewpoint throughout the book, it provides detailed algorithmic strategies for producing efficient realizations of common data structures such as arrays, stacks, queues, linked lists, trees, maps, hash tables, search trees, and graphs. The book also provides an in-depth analysis of algorithmic performance that helps readers to recognize common trade-offs between competing strategies. The book incorporates a host of pedagogical features, including illustrations, code fragments, and end-of-chapter exercises.</subfield>
  </datafield>
  <datafield tag="546" ind1=" " ind2=" ">
    <subfield code="a">English</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2=" ">
    <subfield code="a">CSE</subfield>
    <subfield code="9">14</subfield>
  </datafield>
  <datafield tag="942" ind1=" " ind2=" ">
    <subfield code="c">BK</subfield>
  </datafield>
  <datafield tag="999" ind1=" " ind2=" ">
    <subfield code="c">38037</subfield>
    <subfield code="d">38037</subfield>
  </datafield>
  <datafield tag="952" ind1=" " ind2=" ">
    <subfield code="0">0</subfield>
    <subfield code="1">0</subfield>
    <subfield code="4">0</subfield>
    <subfield code="7">0</subfield>
    <subfield code="8">COMPUTER</subfield>
    <subfield code="a">VAST</subfield>
    <subfield code="b">VAST</subfield>
    <subfield code="c">S-21/CS</subfield>
    <subfield code="d">2025-11-18</subfield>
    <subfield code="e">Calicut Books</subfield>
    <subfield code="g">879.00</subfield>
    <subfield code="i">17740</subfield>
    <subfield code="l">0</subfield>
    <subfield code="o">005.73 GOO</subfield>
    <subfield code="p">38130</subfield>
    <subfield code="r">2025-11-21 15:27:05</subfield>
    <subfield code="w">2025-11-21</subfield>
    <subfield code="y">BK</subfield>
  </datafield>
</record>
