<?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>01058cam a2200229 a 4500</leader>
  <datafield tag="020" ind1=" " ind2=" ">
    <subfield code="a">0131176862</subfield>
  </datafield>
  <datafield tag="020" ind1=" " ind2=" ">
    <subfield code="a">9780131176867</subfield>
  </datafield>
  <datafield tag="020" ind1=" " ind2=" ">
    <subfield code="a">0131277677</subfield>
  </datafield>
  <datafield tag="020" ind1=" " ind2=" ">
    <subfield code="a">9780131277670</subfield>
  </datafield>
  <datafield tag="050" ind1="0" ind2="0">
    <subfield code="a">QA 39.2</subfield>
    <subfield code="b">JOH</subfield>
  </datafield>
  <datafield tag="100" ind1="1" ind2=" ">
    <subfield code="a">Johnsonbaugh, Richard.</subfield>
  </datafield>
  <datafield tag="245" ind1="1" ind2="0">
    <subfield code="a">Discrete mathematics /</subfield>
  </datafield>
  <datafield tag="250" ind1=" " ind2=" ">
    <subfield code="a">6th ed.</subfield>
  </datafield>
  <datafield tag="260" ind1=" " ind2=" ">
    <subfield code="a">Upper Saddle River, N.J. :</subfield>
    <subfield code="b">Pearson Prentice Hall,</subfield>
    <subfield code="c">c2005.</subfield>
  </datafield>
  <datafield tag="300" ind1=" " ind2=" ">
    <subfield code="a">xvi, 672 pages :</subfield>
    <subfield code="b">illustrations ;</subfield>
  </datafield>
  <datafield tag="490" ind1="1" ind2=" ">
    <subfield code="a">The JK computer science and mathematics series,</subfield>
  </datafield>
  <datafield tag="500" ind1=" " ind2=" ">
    <subfield code="a">Includes bibliographical references and index.
</subfield>
  </datafield>
  <datafield tag="505" ind1="0" ind2=" ">
    <subfield code="a">Logic and proofs -- The language of mathematics -- Relations -- Algorithms -- Introduction to number theory -- Counting methods and the pigeonhole principle -- Recurrence relations -- Graph theory -- Trees -- Network models -- Boolean algebras and combinatorial circuits -- Automata, grammars, and languages -- Computational geometry -- A -- Matrices -- B -- Algebra review -- C -- Pseudocode.</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="0">
    <subfield code="a">Mathematics.</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="7">
    <subfield code="a">Computer science - mathematics.</subfield>
  </datafield>
  <datafield tag="942" ind1=" " ind2=" ">
    <subfield code="c">BK</subfield>
  </datafield>
  <datafield tag="952" ind1=" " ind2=" ">
    <subfield code="0">0</subfield>
    <subfield code="1">0</subfield>
    <subfield code="2">lcc</subfield>
    <subfield code="4">0</subfield>
    <subfield code="a">GIMPA</subfield>
    <subfield code="b">GIMPA</subfield>
    <subfield code="c">REF</subfield>
    <subfield code="d">2006-01-04</subfield>
    <subfield code="e">Purchase</subfield>
    <subfield code="l">0</subfield>
    <subfield code="o">GA 39.2 JOH</subfield>
    <subfield code="p">44269</subfield>
    <subfield code="r">2023-09-20</subfield>
    <subfield code="w">2023-09-20</subfield>
    <subfield code="y">BK</subfield>
  </datafield>
  <datafield tag="999" ind1=" " ind2=" ">
    <subfield code="c">3042</subfield>
    <subfield code="d">3042</subfield>
  </datafield>
</record>
