Data Structures & Other Objects Using JavaThe 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. |
From inside the book
Results 1-3 of 82
Page xxiii
Michael Main. Making the Decision Self - Test Exercises Chapter Summary 236 235 235 Solutions to Self - Test Exercises 236 Programming Projects 238 Chapter 5 Java Objects and Iterators 241 5.1 Java's Object Type 242 Widening Conversions ...
Michael Main. Making the Decision Self - Test Exercises Chapter Summary 236 235 235 Solutions to Self - Test Exercises 236 Programming Projects 238 Chapter 5 Java Objects and Iterators 241 5.1 Java's Object Type 242 Widening Conversions ...
Page xxiv
Michael Main. Self - Test Exercises Chapter Summary 275 274 Solutions to Self - Test Exercises 275 Programming Projects 277 Chapter 6 Stacks 279 6.1 Introduction to Stacks 279 The Stack ADT - Specification 281 Writing Nine Stack Classes ...
Michael Main. Self - Test Exercises Chapter Summary 275 274 Solutions to Self - Test Exercises 275 Programming Projects 277 Chapter 6 Stacks 279 6.1 Introduction to Stacks 279 The Stack ADT - Specification 281 Writing Nine Stack Classes ...
Page xxvi
... Self - Test Exercises 381 8.2 Studies of Recursion : Fractals and Mazes 382 Programming Example : Generating Random Fractals 382 A Method for Generating Random Fractals - Specification 383 The Stopping Case for Generating a Random ...
... Self - Test Exercises 381 8.2 Studies of Recursion : Fractals and Mazes 382 Programming Example : Generating Random Fractals 382 A Method for Generating Random Fractals - Specification 383 The Stopping Case for Generating a Random ...
Contents
Chapter | 1 |
Abstract Data Types and Java Classes | 35 |
Collection Classes | 95 |
Copyright | |
30 other sections not shown
Other editions - View all
Common terms and phrases
Accessor method activated addAll addend algorithm applet arithmetic overflow array ArrayBag B-tree bag's binary search binary search tree binary tree BTNode clone method collection class components computation constructor contains copy countOccurrences create current element cursor data type digits doubly linked list empty evaluate example expression Figure hash hash table head reference heap heapsort IllegalArgumentException implements Cloneable Indicates insufficient memory initial capacity input instance variables IntArrayBag integer Integer.MAX_VALUE IntLinkedBag IntNode iterator linked list Location loop manyItems manyNodes mergesort method returns node null reference number of elements OutOfMemoryError Indicates insufficient palindrome parameter parentheses position Postcondition postfix Precondition priority queue pseudocode public boolean public class public int public Object public static void public void quicksort recursive call remove return value returns true root Self-Test Exercises sequence shown simulation specification stack statement step stored String subtree super.clone target Throttle Throws write zero