Java Software Structures: Designing and Using Data StructuresJava Software Structures teaches CS2 students how to develop high quality software systems that will withstand the test of users and the test of time. The authors provide a consistent presentation of data structures, starting with a conceptual overview and moving through an explanation of each data structure's usefulness. Various approaches to implementing each data structure are also explored along with a list of the Pros and Cons for each implementation. Good software engineering practices are kept on the front lines of discussion when it comes to the more complicated data structures. The book is designed to be flexible, allowing professors to cover the collections and issues they want to stress. - Provides a consistent, easy-to-follow presentation of data structures. - Presents material in a flexible way, professors can choose what they want to stress. - Utilizes the graphical user interface in such a way that instructors who dont cover GUIs can skip over these examples easily. - Strong focus on software engineering concepts throughout the text. - Reviews key language concepts in an appendix. - Perfect follow-up to Lewis/Loftus, Java Software Solutions. - Complete supplements pa |
From inside the book
Results 1-3 of 73
Page 48
... empty bag . The value of count is set to zero and the array that will store the elements of the bag is instantiated . This constructor uses a default value for the initial capacity of the contents array . // Creates an empty bag using ...
... empty bag . The value of count is set to zero and the array that will store the elements of the bag is instantiated . This constructor uses a default value for the initial capacity of the contents array . // Creates an empty bag using ...
Page 53
... Empty BagException if the bag is empty and a NoSuchElemetnException if the target is not in the bag . public Object remove ( Object target ) throws Empty BagException , NoSuchElementException { int search = NOT_FOUND ; if ( isEmpty ...
... Empty BagException if the bag is empty and a NoSuchElemetnException if the target is not in the bag . public Object remove ( Object target ) throws Empty BagException , NoSuchElementException { int search = NOT_FOUND ; if ( isEmpty ...
Page 216
... empty , returns false otherwise size - returns the number of elements in the queue 7.3 makeEmpty ( ) , destroy ( ) , full ( ) 7.4 27 , one for each of the 26 letters in the alphabet and 1 to store the whole list before , during , and ...
... empty , returns false otherwise size - returns the number of elements in the queue 7.3 makeEmpty ( ) , destroy ( ) , full ( ) 7.4 27 , one for each of the 26 letters in the alphabet and 1 to store the whole list before , during , and ...
Other editions - View all
Java Software Structures: Designing and Using Data Structures John Lewis,Joseph Chase No preview available - 2004 |
Common terms and phrases
addElement array implementation AVL tree B-tree BigDecimal BigInteger binary search tree binary tree chapter color component concept key Constant values constructors public contains count Creates data structure default defined dequeue derived from object disk doubly linked list empty enqueue Figure final static int hash table hashCode heap icon insertion integer interface isEmpty iterator java.awt java.lang javax.swing key concept layout manager left child linked implementation linked list methods public node null number of elements operation parameter parent path position public abstract public boolean public class public final static public int public Object public static final public String toString public void queue radix sort recursive remove result Returns a string Returns a true Returns or sets right child root Serializable sort algorithm stack static final int string representation StringBuffer traversal true value undirected graph values that represent variables and constructs vertex vertices