MARC details
| 000 -LEADER |
|---|
| fixed length control field |
02388nam a2200241Ia 4500 |
| 003 - CONTROL NUMBER IDENTIFIER |
|---|
| control field |
NULRC |
| 005 - DATE AND TIME OF LATEST TRANSACTION |
|---|
| control field |
20250520100704.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 |
9780133744057 |
| 040 ## - CATALOGING SOURCE |
|---|
| Transcribing agency |
NULRC |
| 050 ## - LIBRARY OF CONGRESS CALL NUMBER |
|---|
| Classification number |
QA 76.9.D33 .C37 2015 |
| 100 ## - MAIN ENTRY--PERSONAL NAME |
|---|
| Personal name |
Carrano, Frank M. |
| Relator term |
author |
| 245 #0 - TITLE STATEMENT |
|---|
| Title |
Data structures and abstractions with JavaTM / |
| Statement of responsibility, etc. |
Frank M. Carrano and Timothy M. Henry |
| 250 ## - EDITION STATEMENT |
|---|
| Edition statement |
Fourth edition |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. |
|---|
| Place of publication, distribution, etc. |
Harlow, Essex, England : |
| Name of publisher, distributor, etc. |
Pearson Education Limited, |
| Date of publication, distribution, etc. |
c2015 |
| 300 ## - PHYSICAL DESCRIPTION |
|---|
| Extent |
xxviii, 897 pages : |
| Other physical details |
illustrations ; |
| Dimensions |
26 cm. |
| 365 ## - TRADE PRICE |
|---|
| Price amount |
USD433.69 |
| 505 ## - FORMATTED CONTENTS NOTE |
|---|
| Formatted contents note |
Introduction: organizing data -- 1. Bags -- 2. Bag implementations that use arrays -- 3. A bag implementation that links data -- 4.The efficiency of algorithms -- 5.Stacks -- 6.Stack implementations -- 7. Recursion -- 8. An introduction to sorting -- 9. Faster sorting methods -- 10.Queues, deques, and priority queues -- 11. Queue, deque, and priority queue implementations -- 12. Lists -- 13. A list implementation that uses an array -- 14. A list implementation that links data -- 15. Iterators for the ADT list -- 16. Sorted lists -- 17. Inheritance and lists -- 18. Searching -- 19. Dictionaries -- 20. Dictionary implementations -- 21.Introducing hashing -- 22. Hashing as a dictionary implementation -- 23.Trees -- 24. Tree implementations -- 25. A binary search tree implementation -- 26. A heap implementation -- 27. Balanced search trees -- 28. Graphs -- 29. Graph implementations. |
| 520 ## - SUMMARY, ETC. |
|---|
| Summary, etc. |
Data Structures and Abstractions with Java is suitable for one- or two-semester courses in data structures (CS-2) in the departments of Computer Science, Computer Engineering, Business, and Management Information Systems. This book is also useful for programmers and software engineers interested in learning more about data structures and abstractions. This is the most student-friendly data structures text available that introduces ADTs in individual, brief chapters — each with pedagogical tools to help students master each concept. Using the latest features of Java, this unique object-oriented presentation makes a clear distinction between specification and implementation to simplify learning, while providing maximum classroom flexibility. |
| 650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name entry element |
DATA STRUCTURES (COMPUTER SCIENCE) |
| 700 ## - ADDED ENTRY--PERSONAL NAME |
|---|
| Personal name |
Henry, Timothy M. |
| Relator term |
co-author |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) |
|---|
| Source of classification or shelving scheme |
Library of Congress Classification |
| Koha item type |
Books |
