MARC details
| 000 -LEADER |
|---|
| fixed length control field |
04318nam a2200253Ia 4500 |
| 003 - CONTROL NUMBER IDENTIFIER |
|---|
| control field |
NULRC |
| 005 - DATE AND TIME OF LATEST TRANSACTION |
|---|
| control field |
20250520100608.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 |
9781449613549 |
| 040 ## - CATALOGING SOURCE |
|---|
| Transcribing agency |
NULRC |
| 050 ## - LIBRARY OF CONGRESS CALL NUMBER |
|---|
| Classification number |
QA 76.64 .D35 2012 |
| 100 ## - MAIN ENTRY--PERSONAL NAME |
|---|
| Personal name |
Dale, Nell |
| Relator term |
author |
| 245 #0 - TITLE STATEMENT |
|---|
| Title |
Object-oriented data structures using Java / |
| Statement of responsibility, etc. |
Nell Dale, Daniel T. Joyce and Chip Weems |
| 250 ## - EDITION STATEMENT |
|---|
| Edition statement |
Third edition. |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. |
|---|
| Place of publication, distribution, etc. |
Sudbury, Massachusetts : |
| Name of publisher, distributor, etc. |
Jone and Bartlett Learning, |
| Date of publication, distribution, etc. |
c2012 |
| 300 ## - PHYSICAL DESCRIPTION |
|---|
| Extent |
xxii, 799 pages : |
| Other physical details |
illustrations ; |
| Dimensions |
24 cm |
| 365 ## - TRADE PRICE |
|---|
| Price amount |
USD50.48 |
| 504 ## - BIBLIOGRAPHY, ETC. NOTE |
|---|
| Bibliography, etc. note |
Includes index. |
| 505 ## - FORMATTED CONTENTS NOTE |
|---|
| Formatted contents note |
Ch. 1. Getting organized. Software engineering ; Object orientation ; Classes, objects, and applications ; Organizing classes ; Data structures ; Basic structuring mechanisms ; Comparing algorithms : big-O analysis -- Ch. 2. Abstract data types. Abstraction ; The StringLog ADT specification ; Array-based StringLog ADT implementation ; Software testing ; Introduction to linked lists ; Linked list StringLog ADT implementation ; Software design : identification of classes ; Case study : a trivia game -- Ch. 3. The stack ADT. Stacks ; Collection elements ; Exceptional situations ; Formal specification ; Array-based implementations ; Application : well-formed expressions ; Link-based implementation ; Case study : postfix expression evaluator -- Ch. 4. Recursion. Recursive definitions, algorithms, and programs ; The three questions ; Towers of Hanoi ; Counting blobs ; Recursive linked-list processing ; Removing recursion ; Deciding whether to use a recursive solution -- Ch. 5. The queue ADT. Queues ; Formal specification ; Array-based implementations ; Application : palindromes ; Application : the card game of War ; Link-based implementations ; Concurrency, interference, and synchronization ; Case study : average waiting time -- Ch. 6. The list ADT. Comparing objects revisited ; Lists ; Formal specification ; Array-based implementations ; Applications : poker, golf, and music ; The binary search algorithm ; Reference-based implementations ; Storing objects and structures in files -- Ch. 7. More lists. Circular linked lists ; Doubly linked lists ; Linked lists with headers and trailers ; A linked list as an array of nodes ; A specialized list ADT ; Case study : large integers -- Ch. 8. Binary search trees. Trees ; The logical level ; The application level ; The implementation level : basics ; Iterative versus recursive method implementations ; The implementation level : remaining operations ; Comparing binary search tree and linear lists ; Balancing a binary search tree ; A nonlinked representation of binary trees ; Case study : word frequency generator -- Ch. 9. Priority queues. Priority queues ; Heaps ; Introduction to graphs ; Formal specification of graph ADT ; Implementations of graphs ; Graph applications -- Ch. 10. Sorting and searching algorithms. Sorting ; Simple sorts ; O(N logΓééN) sorts ; More sorting considerations ; Searching ; Hashing -- Appendix A. Java reserved words -- Appendix B. Operator precedence -- Appendix C. Primitive data types -- Appendix D. ASCII subset of Unicode -- Appendix E. Application of programmer interfaces for the Java classes and interfaces used in this book. |
| 520 ## - SUMMARY, ETC. |
|---|
| Summary, etc. |
This third edition presents traditional data structures and object-oriented topics with an emphasis on problem-solving, theory, and software engineering principles. Key concepts that have been clarified to increase student comprehension and retention include: the use of generics throughout the text, providing the dual benefits of allowing for a type safe use of data structures plus exposing students to modern approaches; addresses the topic of concurrency and synchonization; provides numerous case studies and examples of the problem solving process; case studies includes problem descriptions, an analysis of the problems input and required output, and a discussion of the appropriate data structures to use; and expanded chapter exercises allow you as the instructor to reinforce topics for your students using both theoretical and practical questions. -- Edited summary from book. |
| 650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name entry element |
OBJECT-ORIENTED PROGRAMMING (COMPUTER SCIENCE) |
| 700 ## - ADDED ENTRY--PERSONAL NAME |
|---|
| Personal name |
Joyce, Daniel T. ;Weems, Chip |
| Relator term |
co-author;co-author |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) |
|---|
| Source of classification or shelving scheme |
Library of Congress Classification |
| Koha item type |
Books |
