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 58
Page 131
... insertion sort algorithm sorts a list of values by repetitively insert- ing a particular value into a subset of the list that has already been sorted . One at a time , each unsorted element ... insertion sort : 5.2 sorting 131 insertion sort.
... insertion sort algorithm sorts a list of values by repetitively insert- ing a particular value into a subset of the list that has already been sorted . One at a time , each unsorted element ... insertion sort : 5.2 sorting 131 insertion sort.
Page 255
... insertion into an ArrayList is capacity . The insertion may cause the ArrayList to have to be resized . While certainly this could have an effect on the completion time of a particular insert operation , it does not affect the analysis ...
... insertion into an ArrayList is capacity . The insertion may cause the ArrayList to have to be resized . While certainly this could have an effect on the completion time of a particular insert operation , it does not affect the analysis ...
Page 318
... insertion of a node or through the deletion of a node . Thus , each time one of these operations is per- formed , the balance factors must be updated and the balance of the tree must be checked starting at the point of insertion or ...
... insertion of a node or through the deletion of a node . Thus , each time one of these operations is per- formed , the balance factors must be updated and the balance of the tree must be checked starting at the point of insertion or ...
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