Data structures & algorithm analysis in Java / (Record no. 1293)

MARC details
000 -LEADER
fixed length control field 02821pam a2200325 a 4500
001 - CONTROL NUMBER
control field 3089680
003 - CONTROL NUMBER IDENTIFIER
control field OSt
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20231114093921.0
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 980804s1999 maua b 001 0 eng
010 ## - LIBRARY OF CONGRESS CONTROL NUMBER
LC control number 98038827
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9780201357547
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 0201357542
040 ## - CATALOGING SOURCE
Original cataloging agency BUL
Transcribing agency BUL
Modifying agency BUL
Language of cataloging eng
Description conventions rda
082 00 - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 005.73
Edition number 22
Item number WEI
100 1# - MAIN ENTRY--PERSONAL NAME
Personal name Weiss, Mark Allen.
245 10 - TITLE STATEMENT
Title Data structures & algorithm analysis in Java /
Statement of responsibility, etc. Mark Allen Weiss.
246 30 - VARYING FORM OF TITLE
Title proper/short title Data structures and algorithm analysis in Java
260 ## - PUBLICATION, DISTRIBUTION, ETC.
Place of publication, distribution, etc. Reading, Mass. ;
-- Tokyo ;
-- Bonn :
Name of publisher, distributor, etc. Addison-Wesley Longman, Inc.,
Date of publication, distribution, etc. c1999.
300 ## - PHYSICAL DESCRIPTION
Extent xviii, 542 p. :
Other physical details ill. ;
Dimensions 25 cm.
500 ## - GENERAL NOTE
General note CONTENT :<br/><br/>Chapter 1 Introduction<br/>1.1 Whats the book about ?<br/>1.2 Mathematics review<br/>1.3 A brief introduction to recursion<br/>1.4 Generic objects in java<br/>1.5 Exceptions<br/>etc.<br/><br/>Chapter 2 Algorithm analysis<br/>2.1 Mathematical background<br/>2.2 Model <br/>2.3 What to analyze<br/>2.4 Running time calculations<br/>etc.<br/><br/>Chapter 3 Lists,Stacks and queues<br/>3.1 Abstract data types (ADTs )<br/>3.2 The list ADT<br/>3.3 The stack ADT<br/>3.4 The queue ADT<br/>etc.<br/><br/>Chapter 4 Trees<br/>4.1 Preliminaries<br/>4.2 Binary trees<br/>4.3 The search tree ADT- Binary search trees<br/>4.4 AVL Trees.<br/>etc.<br/><br/>Chapter 5 Hashing<br/>5.1 General idea<br/>5.2 Hash function<br/>5.3 Separate chaining<br/>5.4 Open addressing<br/>5.5 Rehashing<br/>5.6 Extendible hashing<br/><br/>Chapter 6: Priority queues<br/>6.1 Model<br/>6.2 Simple implementations <br/>6.3 Binary heap<br/>6.4 Applications of priority queues<br/>etc.<br/><br/>Chapter 7: Sorting<br/>7.1 Preliminaries<br/>7.2 Insertion sort<br/>7.3 A lower bound for simple sorting algorithms<br/>7.4 Shellsort<br/>etc.<br/><br/>Chapter 8: The disjoint set ADT<br/>8.1 Equivalence relations<br/>8.2 The dynamic equivalence problem<br/>8.3 Basic data structure<br/>8.4 Smart union algorithms <br/>etc.<br/><br/>Chapter 9: Graph algorithms <br/>9.1 Definitions<br/>9.2 Topological sort<br/>9.3 Shortest-path algorithms <br/>etc.<br/><br/>Chapter 10: Algorithms design techniques<br/>10.1 Greedy algorithms<br/>10.2 Divide and conquer<br/>10.3 Dynamic programming<br/>etc.<br/><br/>Chapter 11: Amortized analysis <br/>11.1 An unrelated puzzle<br/>11.2 Binomial queues<br/>11.3 Skew heaps<br/>etc.<br/><br/>Chapter 12: Advanced data structures and implementation<br/>12.1 Top-down splay trees<br/>12.2 Red-black trees<br/>12.3 Deterministic skip lists<br/>etc.<br/><br/><br/>
504 ## - BIBLIOGRAPHY, ETC. NOTE
Bibliography, etc. note Includes bibliographical references and index.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Java (Computer program language)
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Data structures (Computer science)
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Computer algorithms.
906 ## - LOCAL DATA ELEMENT F, LDF (RLIN)
a 7
b cbc
c orignew
d 1
e ocip
f 19
g y-gencatlg
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Source of classification or shelving scheme Dewey Decimal Classification
Koha item type Book Open Access
Classification part 005.73
Item part 1
Call number prefix WEI
Call number suffix 005.73 WEI
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/23/2021 Donation 0011715   005.73 WEI 1 BUML23111894 02/23/2021 1 02/23/2021 Book Open Access