Data structures and algorithm analysis in Java / (Record no. 11461)

MARC details
000 -LEADER
fixed length control field 02290nam a2200241Ia 4500
003 - CONTROL NUMBER IDENTIFIER
control field NULRC
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20250520100703.0
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 250520s9999 xx 000 0 und d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9780273752110
040 ## - CATALOGING SOURCE
Transcribing agency NULRC
050 ## - LIBRARY OF CONGRESS CALL NUMBER
Classification number QA 76.73.J38 .W457 2012
100 ## - MAIN ENTRY--PERSONAL NAME
Personal name Weiss, Mark Allen
Relator term author
245 #0 - TITLE STATEMENT
Title Data structures and algorithm analysis in Java /
Statement of responsibility, etc. Mark Allen Weiss
250 ## - EDITION STATEMENT
Edition statement Third edition
260 ## - PUBLICATION, DISTRIBUTION, ETC.
Place of publication, distribution, etc. Boston, Massachusetts :
Name of publisher, distributor, etc. Pearson Education,
Date of publication, distribution, etc. c2012
300 ## - PHYSICAL DESCRIPTION
Extent 632 pages :
Other physical details illustrations ;
Dimensions 23 cm.
365 ## - TRADE PRICE
Price amount USD39.97
504 ## - BIBLIOGRAPHY, ETC. NOTE
Bibliography, etc. note Includes bibliographical references and index.
505 ## - FORMATTED CONTENTS NOTE
Formatted contents note 1. Introduction -- 2. Algorithm analysis -- 3. Lists, stacks, and queues -- 4. Trees -- 5. Hashing -- 6. Priority queues (heaps) -- 7. Sorting -- 8. The disjoint set class -- 9. Graph algorithms -- 10. Algorithm design techniques -- 11. Amortized analysis -- 12. Advanced data structures and implementation.
520 ## - SUMMARY, ETC.
Summary, etc. Data Structures and Algorithm Analysis in Java is an “advanced algorithms” book that fits between traditional CS2 and Algorithms Analysis courses. In the old ACM Curriculum Guidelines, this course was known as CS7. This text is for readers who want to learn good programming and algorithm analysis skills simultaneously so that they can develop such programs with the maximum amount of efficiency. Readers should have some knowledge of intermediate programming, including topics as object-based programming and recursion, and some background in discrete math. As the speed and power of computers increases, so does the need for effective programming and algorithm analysis. By approaching these skills in tandem, Mark Allen Weiss teaches readers to develop well-constructed, maximally efficient programs in Java. Weiss clearly explains topics from binary heaps to sorting to NP-completeness, and dedicates a full chapter to amortized analysis and advanced data structures and their implementation. Figures and examples illustrating successive stages of algorithms contribute to Weiss’ careful, rigorous and in-depth analysis of each type of algorithm. A logical organization of topics and full access to source code complement the text’s coverage.
650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element DATA STRUCTURES (COMPUTER SCIENCE)
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Source of classification or shelving scheme Library of Congress Classification
Koha item type Books
Holdings
Withdrawn status Lost status Source of classification or shelving scheme Damaged status Not for loan Collection Home library Current library Shelving location Date acquired Source of acquisition Cost, normal purchase price Total checkouts Full call number Barcode Date last seen Copy number Price effective from Koha item type
    Library of Congress Classification     General Education LRC - Graduate Studies National University - Manila General Circulation 03/24/2015 Purchased - Amazon 39.97   GC QA 76.73.J38 .W457 2012 NULIB000009220 05/20/2025 c.1 05/20/2025 Books