Data structures and problem solving using C++ / (Record no. 1274)

MARC details
000 -LEADER
fixed length control field 01418nam a2200229Ia 4500
003 - CONTROL NUMBER IDENTIFIER
control field OSt
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20241210103639.0
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 110411s9999 xx 000 0 und d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9780321205001
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 0321205006
040 ## - CATALOGING SOURCE
Original cataloging agency UMI
Transcribing agency UMI
082 ## - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 005.133
Item number WEI
Edition number 22
100 ## - MAIN ENTRY--PERSONAL NAME
Personal name Weiss, Allen Mark
9 (RLIN) 14946
245 ## - TITLE STATEMENT
Title Data structures and problem solving using C++ /
Statement of responsibility, etc. Mark Allen Weiss.
250 ## - EDITION STATEMENT
Edition statement 2nd ed.
260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT)
Place of publication, distribution, etc. Upper Saddle River :
Name of publisher, distributor, etc. Addison-Wesley,
Date of publication, distribution, etc. c2002.
300 ## - PHYSICAL DESCRIPTION
Extent xvii, 890 p. :
Other physical details ill. ;
Dimensions 24 cm.
500 ## - GENERAL NOTE
General note Table of Contents<br/><br/>I. OBJECTS AND C++. <br/>1. Arrays, Pointers, and Structures. <br/>2. Objects and Classes. <br/>3. Templates. <br/>4. Inheritance. <br/>5. Design Patterns. <br/><br/>II. ALGORITHMS AND BUILDING BLOCKS. <br/>6. Algorithm Analysis. <br/>7. The Standard Template Library. <br/>8. Recursion. <br/>9. Sorting Algorithms. <br/>10. Randomization.<br/><br/> III. APPLICATIONS. <br/>11. Fun and Games. <br/>12. Stacks and Compilers. <br/>13. Utilities. <br/>14. Simulation. <br/>15. Graphs and Paths.<br/><br/> IV. IMPLEMENTATIONS. <br/>16. Stacks and Queues. <br/>17. Linked Lists. <br/>18. Trees. <br/>19. Binary Search Trees. <br/>20. Hash Tables. <br/>21. A Priority Queue: The Binary Heap. <br/><br/>V. ADVANCED DATA STRUCTURES. <br/>22. Splay Trees. <br/>23. Merging Priority Queues. <br/>24. The Disjoint Set Class.
504 ## - BIBLIOGRAPHY, ETC. NOTE
Bibliography, etc Includes bibliographical references and index.
650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Computer programing
9 (RLIN) 14947
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Source of classification or shelving scheme
Koha item type Books-General
Holdings
Withdrawn status Lost status Source of classification or shelving scheme Damaged status Not for loan Collection code Home library Current library Date acquired Cost, normal purchase price Inventory number Total Checkouts Full call number Barcode Date last seen Price effective from Koha item type Public note
Withdrawn Item           Archives Centre Archives Centre 04/13/2011       005.133 WEI 2004-079 04/13/2011 04/13/2011 Books-General  
Item Still in Circulation         Seen During Stock-taking UMI Main Library UMI Main Library 04/13/2011 0.00 1   005.133 WEI 2004-077 04/13/2011 04/13/2011 Books-General Resource for Academic reference, Research and Development
Item Still in Circulation         Seen During Stock-taking UMI Main Library UMI Main Library 04/13/2011 0.00 1   005.133 WEI 2004-078 04/13/2011 04/13/2011 Books-General Resource for Academic reference, Research and Development