Java Software Structures: Designing and Using Data StructuresThe second edition of Java Software Structures embraces the enhancements of Java 5.0, where all structures and collections are based on generics. The framework of the text walks the reader through three main areas: conceptualization, explanation, and implementation, allowing for a consistent and coherent introduction to data structures. The addition of integrated case studies provides complete examples to aid readers starting with the problem statement, to design rationale, through full implementation. Readers will learn how to develop high-quality software systems using well-designed collections and algorithms. |
From inside the book
Results 1-3 of 32
Page 231
... dequeue operation is not the inverse of enqueue . That is , Figure 7.12 Key Concept The enqueue and dequeue operations work on opposite ends of the collection . is not identical to our original configuration shown in Figure 7.10 ...
... dequeue operation is not the inverse of enqueue . That is , Figure 7.12 Key Concept The enqueue and dequeue operations work on opposite ends of the collection . is not identical to our original configuration shown in Figure 7.10 ...
Page 235
... dequeue operation on the queue from Figure 7.14 . As with our linked strategy , the dequeue operation does not bring us back to the original configuration shown in Figure 7.13 because enqueue and dequeue modify opposite ends of the ...
... dequeue operation on the queue from Figure 7.14 . As with our linked strategy , the dequeue operation does not bring us back to the original configuration shown in Figure 7.13 because enqueue and dequeue modify opposite ends of the ...
Page 241
... dequeue operation . dequeue The dequeue operation for the linked implementation consists of the following steps : > Make sure the queue is not empty ( throw an exception if it is ) . > Set a temporary reference equal to the element ...
... dequeue operation . dequeue The dequeue operation for the linked implementation consists of the following steps : > Make sure the queue is not empty ( throw an exception if it is ) . > Set a temporary reference equal to the element ...
Other editions - View all
Java Software Structures: Designing and Using Data Structures John Lewis,Joseph Chase No preview available - 2004 |
Common terms and phrases
abstract data type abstract methods addAll addElement ancestor tree array implementation ArraySet<T AVL tree B-tree binary search tree binary tree BlackJack boolean Card Chapter child class class hierarchy complexity constructor contains count create data structure deck declared defined dequeue disks doubly linked list element stored empty evaluation example exception Figure graph hash table heap ImageIcon inheritance insertion instantiated integer interface invoked isEmpty iterator Java Collections API Key Concept left child Lewis/Chase LIBRARIES linear linked implementation linked list loop ment node null number of elements operand operation parameter parent particular path player position postfix expression problem provides public class public void queue radix sort recursive remove removeRandom represent return result Returns true right child root SAN DIEGO Self-Review Questions set collection sort algorithm stack static String System.out.println throw tion toString traversal UML description undirected graph waterfall model web crawler