<?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>02019nam a22001697a 4500</leader>
  <controlfield tag="008">121102t        xxu||||| |||| 00| 0 eng d</controlfield>
  <datafield tag="020" ind1=" " ind2=" ">
    <subfield code="a">0763706213</subfield>
  </datafield>
  <datafield tag="050" ind1=" " ind2=" ">
    <subfield code="a">QA76.73.C153 D334</subfield>
  </datafield>
  <datafield tag="100" ind1=" " ind2=" ">
    <subfield code="a">Dale Nell</subfield>
  </datafield>
  <datafield tag="245" ind1=" " ind2=" ">
    <subfield code="a">C++ plus data structures. /</subfield>
    <subfield code="c">Nell Dale</subfield>
  </datafield>
  <datafield tag="260" ind1=" " ind2=" ">
    <subfield code="a">Boston:</subfield>
    <subfield code="b">Jones &amp; Barttett Publishers,</subfield>
    <subfield code="c">1999.</subfield>
  </datafield>
  <datafield tag="300" ind1=" " ind2=" ">
    <subfield code="a">xxiii, 773 p.:</subfield>
    <subfield code="b">ill.;</subfield>
    <subfield code="c">24cm.</subfield>
  </datafield>
  <datafield tag="500" ind1=" " ind2=" ">
    <subfield code="a">Includes glossary and index.</subfield>
  </datafield>
  <datafield tag="505" ind1=" " ind2=" ">
    <subfield code="a">Contents: Software engineering principles: Software design process -- Verification of software correctness -- Data design and implementation: Abstraction and built-in types -- Higher level abstraction and the C++ class type -- ADTs unsorted list: Abstract data type unsorted list -- Abstract data type sorted list comparison of algorithms -- Comparison of unsorted and sorted list ADT algorithms -- Class constructors, destructors, and overloading operators -- ADTs stack and queue -- More about generics: C++ templates -- Pointer types -- Dynamically allocated arrays -- Linked structures: Implementing a stack as a linked structure -- Implementing a queue as a linked structure -- Implementing the sorted list as a linked structure -- Implementing the sorted list as a linked structure -- Lists plus: Circular linked list -- Doubly linked lists -- Linked lists with headers and trailers copy structures -- A Specialized list ADT -- A Linked list as an array of records -- Object-oriented design: Composition and inheritance -- Programming with recursion -- Binary search tree -- Trees plus: Binary expression trees -- A nonlinked representation of binary trees -- ADT priority queue -- Graphs -- Sorting and searching algorithms: Sorting -- Searching -- Radix sort -- Appendix A: A Reserved words -- Appendix B: Operator procedence -- Appendix C: Description of selected operators -- Appendix D: C++ library routines and constants -- Appendix E: The character sets.</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2=" ">
    <subfield code="a">C++ (Computer program language) Data structures (Computer science) COMPUTERS -- Data Processing</subfield>
  </datafield>
  <datafield tag="942" ind1=" " ind2=" ">
    <subfield code="2">lcc</subfield>
    <subfield code="c">BK</subfield>
  </datafield>
  <datafield tag="999" ind1=" " ind2=" ">
    <subfield code="c">2489</subfield>
    <subfield code="d">9989</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="7">0</subfield>
    <subfield code="a">WIUC-1</subfield>
    <subfield code="b">WIUC-1</subfield>
    <subfield code="c">REF</subfield>
    <subfield code="d">2012-11-02</subfield>
    <subfield code="l">0</subfield>
    <subfield code="o">QA76.73.C153 D334</subfield>
    <subfield code="p">6228/12</subfield>
    <subfield code="r">2012-11-02 00:00:00</subfield>
    <subfield code="t">1</subfield>
    <subfield code="w">2012-11-02</subfield>
    <subfield code="y">BK</subfield>
  </datafield>
</record>
