Java Software Structures: Designing and Using Data Structures
Java 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
63 pages matching root in this book
Results 1-3 of 63
What people are saying - Write a review
We haven't found any reviews in the usual places.
30 other sections not shown
array implementation AVL tree B-tree BigDecimal BigInteger binary search tree binary tree color component Constant values constructors public contains count Creates data structure default defined dequeue derived from Object disk doubly linked list empty enqueue Figure final int VK_ final static int hash table hashCode heap icon insertion integer interface isEmpty iterator java.lang layout manager left child Lewis/Chase linked implementation linked list 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 static void 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