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

Front Cover
Wiley, Mar 30, 2001 - Computers - 566 pages

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.

From inside the book

 

Contents

Summary
5
Algorithms
12
The Array Data Structure
37
Copyright

20 other sections not shown

Common terms and phrases

abstract data type Accessors addAll application code array AVL-tree B-tree binary search binary tree BSTNode bucket CBHT collection classes Comparable complexity components constructor curr data structures deletion algorithm directed graph edge element elem empty entry equal example Figure game tree given hash function hash table initially inner class input insertion algorithm insertion sort instance variables integer interface iterator Java class Java implementation Java method leaf node left child length linear search linked lists maze merging algorithm node containing node curr's node's NoSuchElementException null O(log OBHT operations position priority queue private int private static public boolean public class public int public Object public static public void recursive remove representation represented Return true right child right subtree root node search algorithm Section SLLNode sort algorithm stack step street intersection String student subarray Terminate with answer throw traversal visited words

About the author (2001)

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.

Bibliographic information

TitleJava Collections: An Introduction to Abstract Data Types, Data Structures and Algorithms
AuthorsDavid A. Watt, Deryck F. Brown
Editionillustrated
PublisherWiley, 2001
Original fromthe University of Michigan
Digitized16 Nov 2007
ISBN047189978X, 9780471899785
Length566 pages
Subjects ›  › 

Computers / Languages / Java
Computers / Programming / General
  
Export CitationBiBTeX EndNote RefMan