Data abstraction and problem solving with C++ : (Record no. 901)

MARC details
000 -LEADER
fixed length control field 03299pam a2200313 a 4500
003 - CONTROL NUMBER IDENTIFIER
control field OSt
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20231012113317.0
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 970723s1998 maua 001 0 eng
010 ## - LIBRARY OF CONGRESS CONTROL NUMBER
LC control number
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 0201874024
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9780201874020
040 ## - CATALOGING SOURCE
Original cataloging agency BUL
Transcribing agency BUL
Modifying agency BUL
Language of cataloging ENG
Description conventions RDA
050 00 - LIBRARY OF CONGRESS CALL NUMBER
Classification number 005.133
082 00 - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 005.133
Edition number 22
Item number CAR
100 1# - MAIN ENTRY--PERSONAL NAME
Personal name Carrano, Frank M.
245 10 - TITLE STATEMENT
Title Data abstraction and problem solving with C++ :
Remainder of title walls and mirrors /
Statement of responsibility, etc. Frank M. Carrano, Paul Helman, Robert Veroff.
250 ## - EDITION STATEMENT
Edition statement 2nd ed.
260 ## - PUBLICATION, DISTRIBUTION, ETC.
Place of publication, distribution, etc. Reading, Mass. :
Name of publisher, distributor, etc. Addison-Wesley,
Date of publication, distribution, etc. c1998.
300 ## - PHYSICAL DESCRIPTION
Extent xxi, Various pages.:
Other physical details ill. ;
Dimensions 26 cm.
500 ## - GENERAL NOTE
General note Table of Content<br/> <br/>Chapter 1 Principles pf programming and software engineering<br/>What problem solving and software engineering<br/>Achieving a Modular design<br/>A Summary of key issues in programming<br/>Summary<br/><br/><br/>Chapter 2 Recursion: the mirrors.<br/>Recursion solutions<br/>Counting things<br/>Organizing a parade<br/>Searching an array<br/>etc<br/><br/>Chapter 3 Data abstraction: the walls <br/>Abstract data types.<br/>Specifying ADTs<br/>Implementing ADTs<br/>Programming Problems<br/><br/>Chapter 4 Linked lists <br/>Preliminaries <br/>Pointers<br/>Dynamic allocation of arrays <br/>Programming with linked lists<br/>Variations of the linked lists<br/>etc.<br/><br/>Chapter 5 Recursion as a problem-solving technique <br/>Backtracking <br/>The eight queens problem<br/>Defining languages<br/>Relationships between recursion and mathematical induction<br/>etc.<br/><br/>Part II Problem solving with abstract data types<br/>Chapter 6 Stacks<br/>The abstract data type stack<br/>Developing an ADT during the design of a solution<br/>Simple application of the ADT stack<br/>Implementation of ADT stacks<br/>etc.<br/><br/>Chapter 7 queues <br/>The abstract data types queue <br/>Simple applications of the ADT queue <br/>Reading a string of characters <br/>Implementation of the ADT Queues<br/>etc<br/><br/>Chapter 8 Class relationships<br/>Inheritance <br/>Public, private, and protected inheritance <br/>Is-a, Has-a and as-a relationships <br/>Virtual function and late binding <br/>The ADTS lists and sorted list revisited<br/>Class templates<br/>Overloaded operators<br/>etc.<br/><br/>Chapter 9 Algorithm efficiency and sorting <br/>Measuring the efficiency of algorithms <br/>The execution of time of algorithms<br/>Algorithm growth rates.<br/>Sorting Algorithms and their efficiency<br/>etc.<br/><br/>Chapter 10 trees <br/>Terminology <br/>The ADT binary <br/>Traversals of a binary tree.<br/>The ADT Binary search tree<br/>etc.<br/><br/>Chapter 11 Tables and priority queens<br/>The ADT table.<br/>Selecting an implementation<br/>A sorted array-based implementation of the ADT table.<br/>The ADT Priority Queue: A variation of the ADT Table <br/>etc.<br/><br/>Chapter 12 Advanced Implementation of tables<br/>Balanced search<br/>Hashing<br/>Hash functions.<br/>Data with multiple Organisation<br/><br/><br/>Chapter 13 Graphs <br/>Terminology<br/>Graphs as ADTs <br/>Implementations <br/>Graph transversal<br/>etc.<br/><br/>Chapter 14 External methods<br/>A look at External storage<br/>Sorting data in an external file<br/>External hashing<br/><br/><br/>
501 ## - WITH NOTE
With note Includes indexes : p. : A113 - 1-11
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element C++ (Computer program language)
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Abstract data types (Computer science)
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Problem solving
General subdivision Data processing.
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Helman, Paul.
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Veroff, Robert.
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Source of classification or shelving scheme Dewey Decimal Classification
Koha item type Book Open Access
Edition 2nd edition
Classification part 005.133
Item part 1
Call number prefix CAR
Call number suffix 005.133 CAR
Holdings
Withdrawn status Lost status Source of classification or shelving scheme Damaged status Not for loan Home library Current library Date acquired Source of acquisition Inventory number Total Checkouts Full call number Barcode Date last seen Copy number Price effective from Koha item type
    Dewey Decimal Classification     Engineering Library Engineering Library 02/09/2021 Donation 0012078   005.133 CAR BUML23100924 02/09/2021 1 02/09/2021 Book Open Access