Java Collections: An Introduction to Abstract Data Types, Data Structures and Algorithms
March 2001, ©2001
Paying close attention to the Java 2 collection classes, this book is designed to give programmers the ability to choose the best collection classes for each application. The focus of the book is on abstract data types (ADTs) that turn up again and again in software design. It will use these ADTs to introduce the data structures required to implement them and the algorithms associated with the data structures.
Suitable for a first course in algorithms and data structures, or a second course in programming using Java, this text 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.
Primarily targetted at students of computer science or information technology, but also of interest to professional programmers and software engineers who are retraining to program in Java.
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.
Appendix A: Summary of Mathematics for Algorithm Analysis.
Appendix B: Summary of Java.
Appendix C: Summary of the Java Collections Framework.
Deryck Brown is a Senior Lecturer in Computing Science at the Robert Gordon University, Aberdeen.
- Motivates study of algorithms and data structures by introducing them in context
- Adopts a practical (software engineering) approach, rather than a theoretical one
- Maintains an ADT-centred approach
- Pays close attention to Java 2 collection classes
- Includes numerous worked examples, several larger case studies, end-of-chapter exercises and projects and sample solutions to selected exercises
- Complemented by a booksite