<?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>     nam a22     7a 4500</leader>
  <datafield tag="999" ind1=" " ind2=" ">
    <subfield code="c">13094</subfield>
    <subfield code="d">13094</subfield>
  </datafield>
  <controlfield tag="003">OSt</controlfield>
  <controlfield tag="005">20230915144657.0</controlfield>
  <controlfield tag="008">230915b        xxu||||| |||| 00| 0 eng d</controlfield>
  <datafield tag="020" ind1=" " ind2=" ">
    <subfield code="a">9789332585348</subfield>
  </datafield>
  <datafield tag="040" ind1=" " ind2=" ">
    <subfield code="c">AEF</subfield>
  </datafield>
  <datafield tag="082" ind1=" " ind2=" ">
    <subfield code="2">23rd ed.</subfield>
    <subfield code="a">005.133</subfield>
    <subfield code="b">TAN</subfield>
  </datafield>
  <datafield tag="100" ind1=" " ind2=" ">
    <subfield code="a">Taneja, Sheetal.</subfield>
    <subfield code="9">3348</subfield>
  </datafield>
  <datafield tag="245" ind1=" " ind2=" ">
    <subfield code="a">Python programming:</subfield>
    <subfield code="b">a modular approch with graphics, database, mobile and web applications</subfield>
  </datafield>
  <datafield tag="250" ind1=" " ind2=" ">
    <subfield code="a">1st ed.</subfield>
  </datafield>
  <datafield tag="260" ind1=" " ind2=" ">
    <subfield code="a">New Delhi:</subfield>
    <subfield code="b">Pearson,</subfield>
    <subfield code="c">2022</subfield>
  </datafield>
  <datafield tag="300" ind1=" " ind2=" ">
    <subfield code="a">588 p.:</subfield>
    <subfield code="c">24 cm</subfield>
  </datafield>
  <datafield tag="505" ind1=" " ind2=" ">
    <subfield code="a"> Features

ll A chapter on debugging &#x2014; an essential skill for making the programs work

ll Includes basic sorting and searching techniques&#x2014; selection sort, bubble sort, insertion sort, merge sort, quick sort, and linear and binary search

ll Comprehensive treatment of recursion, including problems such as list manipulation, Tower of Hanoi, permutation generation, n-queens problem, Sudoku, and plotting Hilbert curves

ll Margin notes and chapter summary for quick review of the concepts

Market

Undergraduate students of Computer Science
</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2=" ">
    <subfield code="a">Python (Computer program language)</subfield>
    <subfield code="9">3349</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2=" ">
    <subfield code="a">Computer science</subfield>
    <subfield code="9">3350</subfield>
  </datafield>
  <datafield tag="700" ind1=" " ind2=" ">
    <subfield code="a">Kumar, N.</subfield>
    <subfield code="9">3351</subfield>
  </datafield>
  <datafield tag="942" ind1=" " ind2=" ">
    <subfield code="2">ddc</subfield>
    <subfield code="c">Book</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">AEF</subfield>
    <subfield code="b">AEF</subfield>
    <subfield code="d">2023-09-16</subfield>
    <subfield code="e">20</subfield>
    <subfield code="g">468.00</subfield>
    <subfield code="p">8635</subfield>
    <subfield code="r">2023-09-16</subfield>
    <subfield code="v">585.00</subfield>
    <subfield code="w">2023-09-16</subfield>
    <subfield code="y">Book</subfield>
  </datafield>
</record>
