Register your product to gain access to bonus material or receive a coupon.
Data Structures and Abstractions with Java, 2nd Edition
- By Frank M. Carrano
- Published Aug 4, 2006 by Pearson. Part of the GOAL Series series.
Book
- Sorry, this book is no longer in print.
About
Features
• Thorough, up-to-date Java coverage – Includes more features of
Java, including generic data types, assertions, enumeration, for-each loops, and aspects of the Java
Class Library, with extensive support within the text and appendices. Program comments use the javadoc style.
• Approachable format and content organization – Organizes
material into small segments that focus a reader’s attention
and provide greater instructional flexibility.
• Each ADT is introduced in its own chapter, including
examples or applications – Provides for instructor
flexibility while retaining the advantage of separation of
specification and implementation.
• Flexible and extensive assignments – Features a variety of
exercises and programming projects that can be used in- class or assigned as homework, as well as self-test questions throughout each chapter.
• Visually appealing – Attractive design includes many figures to aid student comprehension.
• Complete support package – Includes Solutions Manuals, CD-
ROM with animations of various data structures, Lab Manual,
and PowerPoint slides.
• Companion Web site — Provides all the Java code from the text, PowerPoint slides, and animations.
Description
- Copyright 2007
- Dimensions: 8" x 10"
- Pages: 1024
- Edition: 2nd
- Book
- ISBN-10: 0-13-237045-X
- ISBN-13: 978-0-13-237045-5
Using the latest features of Java 5, this unique object-oriented presentation introduces readers to data structures via thirty, manageable chapters.
KEY FeaturesTOPICS:
Introduces each ADT in its own chapter, including examples or applications. Provides
aA variety of exercises and projects, plus additional self-assessment questions throughout. the text
Includes generic data types as well as enumerations, for-each loops, the interface Iterable, the class Scanner, assert statements, and autoboxing and unboxing.
Identifies important Java code as a Listing. Provides
NNotes and Pprogramming Ttips in each chapter. MARKET: For programmers and software engineers interested in learning more about data structures and abstractions.
Sample Content
Table of Contents
Introduction
Chapter 1 Java Classes
Chapter 2 Creating Classes from Other Classes
Chapter 3 Designing Classes
Chapter 4 Lists
Chapter 5 List Implementations That Use Arrays
Chapter 6 A List Implementation That Links Data
Chapter 7 Completing the Linked Implementation of a List
Chapter 8 Iterators
Chapter 9 The Efficiency of Algorithms
Chapter 10 Recursion
Chapter 11 An Introduction to Sorting
Chapter 12 Faster Sorting Methods
Chapter 13 Sorted Lists
Chapter 14 Inheritance and Lists
Chapter 15 Mutable, Immutable, and Cloneable Objects
Chapter 16 Searching
Chapter 17 Dictionaries
Chapter 18 Dictionary Implementations
Chapter 19 Introducing Hashing
Chapter 20 Hashing as a Dictionary Implementation
Chapter 21 Stacks
Chapter 22 Stack Implementations
Chapter 23 Queues, Deques, and Priority Queues
Chapter 24 Queue, Deque, and Priority Queue Implementations
Chapter 25 Trees
Chapter 26 Tree Implementations
Chapter 27 A Binary Search Tree Implementation
Chapter 28 A Heap Implementation
Chapter 29 Balanced Search Trees
Chapter 30 Graphs
Chapter 31 Graph Implementations
Appendix A Java Essentials
Appendix B Exception Handling
Appendix C File Input and Output
Appendix D Documentation and Programming Style
Appendix E Answers to Self-Test Questions
Index