Java Software Structures: Designing and Using Data Structures
The 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.
Results 1-3 of 18
A LIST ADT Key Concept List collections can be categorized as ordered,
unordered, and indexed. The elements of an ordered list have an inherent
relationship defining their order. i iJiBliJkey Concept The elements of an
unordered list are ...
Analysis of Ordered List Implementations The add operations of the two
implementations are nearly identical. ... Very much like the addAf ter operation for
unordered lists, the add operation for the array implementation of ordered lists
Summary of Key Concepts > List collections can be categorized as ordered,
unordered, and indexed. > The elements of an ordered list have an inherent
relationship defining their order. > The elements of an unordered list are kept in
What people are saying - Write a review
17 other sections not shown