Java Collections
An Introduction to Abstract Data Types, Data Structures and Algorithms

1. Edition February 2001
XVI, 549 Pages, Softcover
Handbook/Reference Book
Short Description
This book offers a unique angle by concentrating on the in-built collection classes in Java 2, enabling more emphasis on software design and less on theory. It gives programmers the ability to choose the best collection classes for each application.
A unique, practical approach to working with collection classes in Java 2
Software developers new to Java will find the practical, software-engineering based approach taken by this book extremely refreshing. With an emphasis more on software design and less on theory, Java Collections explores in detail Java 2 collection classes, helping programmers choose the best collection classes for each application they work on. Watt and Brown explore abstract data types (ADTs) that turn up again and again in software design, using them to provide context for the data structures required for their implementation and the algorithms associated with the data structures. Numerous worked examples, several large case studies, and end-of-chapter exercises are also provided.
Introduction.
Algorithms.
The Array Data Structure.
Linked-List Data Structures.
Abstract Data Types.
Stack Abstract Data Types.
Queue Abstract Data Types.
List Abstract Data Types.
Set Abstract Data Types.
Binary Tree Data Structures.
Map Abstract Data Types.
Hash-Table Data Structures.
Priority-Queue Abstract Data Types.
Tree Abstract Data Types.
Graph Abstract Data Types.
Balanced Search Treet Data Structures.
Conclusion.
Appendix A: Summary of Mathematics for Algorithm Analysis.
Appendix B: Summary of Java.
Appendix C: Summary of the Java Collections Framework.
Further Reading.
Index.
Deryck Brown is a Senior Lecturer in Computing Science at the Robert Gordon University, Aberdeen.