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 73
Page 100
... empty set . The value of count is set to zero and the array that will store the elements of the set is instantiated . This constructor uses a default value for the initial capacity of the contents array . // Creates an empty set using ...
... empty set . The value of count is set to zero and the array that will store the elements of the set is instantiated . This constructor uses a default value for the initial capacity of the contents array . // Creates an empty set using ...
Page 241
... empty ( throw an exception if it is ) . > Set a temporary reference equal to the element pointed to by the element reference of the node pointed to by the front reference . > Set the front reference equal to the next reference of the ...
... empty ( throw an exception if it is ) . > Set a temporary reference equal to the element pointed to by the element reference of the node pointed to by the front reference . > Set the front reference equal to the next reference of the ...
Page 247
... empty , the rear also points to position 0 . 7.7 Yes , it can happen under two circumstances : when the queue is empty , and when the queue is full . 7.8 The noncircular array implementation with an O ( n ) dequeue opera- tion has the ...
... empty , the rear also points to position 0 . 7.7 Yes , it can happen under two circumstances : when the queue is empty , and when the queue is full . 7.8 The noncircular array implementation with an O ( n ) dequeue opera- tion has the ...
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