9780321375254

Data Structures and Other Objects Using Java

by
  • ISBN13:

    9780321375254

  • ISBN10:

    0321375254

  • Edition: 3rd
  • Format: Paperback
  • Copyright: 2006-01-01
  • Publisher: Addison Wesley
  • View Upgraded Edition

Note: Supplemental materials are not guaranteed with Rental or Used book purchases.

Purchase Benefits

  • Free Shipping On Orders Over $35!
    Your order must be $35 or more to qualify for free economy shipping. Bulk sales, PO's, Marketplace items, eBooks and apparel do not qualify for this offer.
  • Get Rewarded for Ordering Your Textbooks! Enroll Now
List Price: $125.00 Save up to $31.25
  • Buy Used
    $93.75
    Add to Cart Free Shipping

    USUALLY SHIPS IN 2-4 BUSINESS DAYS

Supplemental Materials

What is included with this book?

Summary

Takes a gentle approach to learning data structures using the Java programming language. Providing an early, self-contained review of object-oriented programming and Java, this text gives readers a firm grasp of key concepts and allows those experienced in another language to adjust easily. It has a solid foundation in building and using abstract data types, along with an assortment of advanced topics such as B-trees for project building and graph. It incorporates Java 5.0 including the use of scanner class and generic data types (generics). MARKET: This book is if for anyone interested in learning how to write effective data structures using the Java language.

Table of Contents

The Phases of Software Development
Specification, Design, Implementation
Running Time Analysis
Testing and Debugging
Abstract Data Types and Java Classes
Classes and Their Members
Using a Class
Packages
Parameters, Equals Methods, and Clones
Collection Classes
A Review of Java Arrays
An ADT for a Bag of Integers
Programming Project: The Sequence ADT
Applets for Interactive Testing
Linked Lists
Fundamentals of Linked Lists
Methods for Manipulating Nodes
Manipulating an Entire Linked List
The Bag ADT with a Linked List
Programming Project: The Sequence ADT with a Linked List
Arrays vs. Linked Lists vs. Doubly Linked Lists
Java Objects and Iterators
Java's Object Type
A Bag of Objects
JCL Collections and Nodes of Objects
Iterators
Stacks
Introduction to Stacks
Stack Applications
Implementations of the Stack ADT
More Complex Stack Applications
Queues
Introduction to Queues
Queue Applications
Implementations of the Queue
ADT
Priority Queues
Recursive Thinking
Recursive Methods
Studies of Recursion: Fractals and Mazes
Reasoning about Recursion
Trees
Introduction to Trees
Tree Representations
A Class for Binary Tree Nodes
Tree Traversals
Binary Search Trees
Tree Projects
Heaps
B-Trees
Trees, Logs, and Time Analysis
Searching
Serial Search and Binary Search
Open-Address Hashing
Using Java's Hashtable Class
Chained Hashing
Time Analysis of Hashing
Sorting
Quadratic Sorting Algorithms
Recursive Sorting Algorithms
An O(N LOG N) Algorithm Using a Heap
Software Reuse with Extended Classes
Extended Classes
Simulation of an Ecosystem
Using Extended Classes for ADTs
Graphs
Graph Definitions
Graph Implementations
Graph Traversals
Path Algorithms
Appendices
Java's Primitive Types and Arithmetic Overflow
Java Input
Throwing and Catching Java Exceptions
Java's Vector and Hashtable
A Class for Nodes in a Linked List
A Class for a Bag of Objects
Further Big-O Notation
Javadoc
Table of Contents provided by Publisher. All Rights Reserved.

Rewards Program

Write a Review