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 83
Page 147
... stack . Removes an element from the top of the stack . Examines the element at the top of the stack . Determines if the stack is empty . Determines the number of elements on the stack . figure 6.2 The operations on a stack Sometimes ...
... stack . Removes an element from the top of the stack . Examines the element at the top of the stack . Determines if the stack is empty . Determines the number of elements on the stack . figure 6.2 The operations on a stack Sometimes ...
Page 159
... stack = pushNewPos ( pos.getx ( ) , pos.gety ( ) 1 , stack ) ; stack = pushNewPos ( pos.getx ( ) , pos.gety ( ) + 1 , stack ) ; stack = pushNewPos ... stack adds and 6.4 implementing stacks : with links 159 implementing stacks: with links.
... stack = pushNewPos ( pos.getx ( ) , pos.gety ( ) 1 , stack ) ; stack = pushNewPos ( pos.getx ( ) , pos.gety ( ) + 1 , stack ) ; stack = pushNewPos ... stack adds and 6.4 implementing stacks : with links 159 implementing stacks: with links.
Page 167
... Stack class is derived from the vector class and uses its inherited capabilities to store the elements in the stack . Since this implementation is built upon a vector , it ... Stack << 6.6 implementing stacks : the java.util.Stack class 167.
... Stack class is derived from the vector class and uses its inherited capabilities to store the elements in the stack . Since this implementation is built upon a vector , it ... Stack << 6.6 implementing stacks : the java.util.Stack class 167.
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