Java Collections
An Introduction to Abstract Data Types, Data Structures and Algorithms
Published on 9. February 2001
Book
Paperback/Softback
XVI, 549 pages
978-0-471-89978-5 (ISBN)
Description
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.
Reviews / Votes
"A lovely book. I will use this book a lot in the next few months on a Java project I'm just starting." (CVu, December 2001)More details
Product info
Paperback
Edition
1. Auflage
Language
English
Place of publication
New York
United States
Target group
College/higher education
Professional and scholarly
Product notice
Paperback (trade)
Unsewn / adhesive bound
Dimensions
Height: 233 mm
Width: 187 mm
Thickness: 34 mm
Weight
1021 gr
ISBN-13
978-0-471-89978-5 (9780471899785)
Schweitzer Classification
Persons
David Watt is a Professor of Computing Science at the University of Glasgow.
Deryck Brown is a Senior Lecturer in Computing Science at the Robert Gordon University, Aberdeen.
Content
Preface.
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.