Table Of ContentJava: Data Structures and Programming
Springer
Berlin
Heidelberg
New York
Barcelona
Budapest
Hong Kong
London
Milan
Paris
Singapore
Tokyo
Liwu Li
Java:
Data Structures
and Programming
With 44 Figures
Including CD-ROM
" Springer
Professor Liwu Li
University of Windsor, School of Computer Science
401 Sunset, Windsor, Ontario N9B 3P4
Canada
E-mail: [email protected]
Library of Congress Cataloging-in-Publication Data
Li, Liwu.
Java: data structures and programming/Liwu Li.
p. cm.
Includes bibliographical references and index.
1. Java (Computer program language) 2. Data structures
(Computer science) I. Title.
QA76.73.J38L5 1998
005.7'3--dc21 98-25666 CIP
Springer-Verlag Berlin Heidelberg NewY ork
This work is subject to copyright. All rights are reserved, whether the whole or part
of the material is concerned, specifically the rights of translation, reprinting, reuse
of illustrations, recitation, broadcasting, reproduction on micro-film or in any other
way, and storage in data banks. Duplication of this publication or parts thereof is
permitted only under the provisions of the German Copyright Law of September
9,1965, in its current version, and permission for use must always be obtained
from Springer-Verlag. Violations are liable for prosecution under the German
Copyright Law.
© Springer-Verlag Berlin Heidelberg 1998
Softcover reprint of the hardcover 1s t edition 1998
ISBN-13: 978-3-642-95853-3 e-ISBN-13: 978-3-642-95851-9
DOl: 10 .1 007/978-3-642-95851-9
Preface
This book is written for practitioners of software development and for students of
computer science who are interested in using the Java language to construct data
structures. The book assumes general knowledge of computer programming but
no experience of Java programming or object modeling for the readers. It intro
duces the Java language and object model by going through examples of data
modeling.
The book emphasizes programming skills for developing various types of
data structure and fundamental techniques for complexity analysis. The program
ming skills are necessary for software development. The analysis techniques are
needed to ensure performance of programs. The author has been responsible for
teaching a data structure course for years. The book carries out his expectations
for proficiency in both programming and complexity analysis from students.
Several features of the book distinguish it from other books on data struc
tures. A challenge for the book is relating the complexity analysis to the Java
Virtual Machine, which isolates Java programmers from platform issues. The
book devotes a chapter to discuss the structure of Java class files and the Java
Virtual Machine. The book presents the problem of maximum flow and imple
ments algorithms in Java to evaluate maximum flow for networks. It introduces
persistent data structures, which may be included by some practitioners in their
projects.
As a faculty member of School of Computer Science at University of Wind
sor, the author acknowledges the opportunity of teaching and research provided by
the university. The author is grateful for encourages the author received from his
colleagues and students while the,book was prepared.
The whole process of the book preparation was consistently supported by Dr.
Hans Wossner, Executive Editor, Computer Science Editorial I at Springer
Verlag. The author is particularly grateful for the careful reviewing arranged by
Springer-Verlag, which helped removing some weaknesses from the manuscript
of the book. J. Andrew Ross, English Copy Editor, and Peter Strasser, Production
Editor at Springer-Verlag, gave valuable suggestions and comments on the manu
script.
The author is solely responsible for any errors in the book. Comments on the
book are welcome. The author can be reached at [email protected].
VI Preface
Overview
The Java language is widely accepted for software development due to its port
ability, type safety, security, and other interesting features. It is attractive for Web
applications. For quality software, we often need to design customized data
structures for different applications. Data structures are indispensable components
of software systems to support functionality of the systems and for efficient stor
age, retrieval, and manipulation of information. The book is an introduction to
programming object-oriented data structures in Java.
Object-oriented programming languages are founded on an object model. The
skill of object-oriented analysis and the knowledge of the Java language are ne
cessities for Java data structure programmers. The book presents the Java object
model for application analysis and the Java language for data structure program
ming.
The success of Java is attributable to the Java Virtual Machine (JVM). Here
we present the JVM as an abstract machine like a traditional Turing or random
access machine. To take the full advantage of the Java language, the book relates
the analysis of programs and data structures with the JVM.
The book presents common data structure classes in Java. The data structures
include linear linked lists, trees, graphs, and networks.
Most non-trivial applications need data persistence and/or data transportation.
Java provides a mechanism for object serialization and deserialization. The book
presents the Java serialization mechanism and introduces an approach to serializ
ing data structures for efficient storage and transportation.
Contents
The book is divided into four parts:
• Part I introduces Java programming. It shows how Java supports the object
concepts and how to apply the Java constructs for data modeling. It presents
the Java language and the Java standard data structure classes. The fIrst part
of the book consists of Chapters 1,2,3, and 4.
• Part II presents the JVM as an abstract machine. It relates the analysis of data
structures with the JVM. It introduces basic notions for algorithm analysis
and applies the notions for Java programs. The second part consists of Chap
ters 5 and 6.
• Part m presents classes for linear linked lists, trees, graphs, and networks.
This part dedicates one chapter for each of the data structures. It consists of
Chapters 7, 8,9, and 10.
• Part IV presents the classes and interfaces of the Java serialization mecha
nism. It shows how to apply the mechanism to generate efficient serial repre
sentations of data structures. The part consists of Chapters 11 and 12.
Preface VII
The book leaves some exercises in the running text. The exercises are rele
vant to the discussed topics. Some of the exercises are programming exercises.
The book presents assignments at the end of some chapters. The assignments can
be used to practice the topics or notions presented in the chapters.
Roadmaps
We present a roadmap for each part of the book in the following. The roadmaps
guide reading by interests.
Part I of the book looks at how to apply object-oriented concepts in applica
tion analysis and how to construct Java programs. It presents the Java object
model by studying a simplified supermarket. It introduces the Java language and
the standard Java data structures. Graphics user interfaces (GUIs) should be used
for users to enter data into data structures and retrieve data from a system. Part I
shows how to construct GUIs.
As shown in Fig. 1, Chapters 1 and 2 are relatively independent from each
other. Chapter 1 introduces Java constructs with examples. Chapter 2 presents the
Java language. A reader may start Java programming by reading Chapter 1 and
then going to Chapter 3 without reading Chapter 2. Chapter 4 presents the Java
data structure classes. It extends the functionality of the Java language.
Part I is for self-containment of the book. A reader who is familiar with the
Java language and has sufficient Java programming experience can skip the part.
The part assumes some computer programming experience for readers. A reader
with no experience of object-oriented programming or knowledge of object
oriented languages may fmd the part helpful.
yes yes
Chapter 1 Chapter 2
Data Modeling in Java The Java Language
Chapter 3 Chapter 4
Programming in Java Java Data Structures
Fig. 1 Roadmap for Part I
VlII Preface
As shown in Fig. 2, Chapter 6 is based on
Chapter 5, which presents the NM as an abstract
computational model. Chapter 5 discusses the vari
ous types of NM instructions with respect to time
and space requirement. Chapter 6 introduces the no
tion of analysis for algorithms and data structures yes
that are implemented in Java. It lays the foundation
for designing efficient data structures and algorithms
in Java. ChapterS
Java Virtual Machine
Chapters 7,8,9, and 10 in Part III are independ
ent from each other. They present different types of
data structure. A reader may read the chapters in any
order. However, the inherent complexity of the data
structures increases from Chapters 7 to 10. For ex
ample, a student may find reading Chapter 7 is easier
than fIrst reading other chapters. Reading Chapter 7
helps understand other chapters. Chapter 10 presents
advanced algorithms for maximizing network flows.
An instructor may skip the chapter in a junior under
graduate course.
Part III analyzes some algorithms implemented
in Java as well as presenting data structure classes. It
Chapter 6
discusses the correctness and efficiency of the Java
Complexity Analysis
programs. This part is the core of the book. Readers
can apply and adapt the classes in their programs.
In Part IV, Chapter 11 introduces the Java se Fig. 2 Roadmap for Part II
rialization mechanism. Chapter 12 depends on
Chapter 11. It discusses how to serialize data
structures.
Font Use
The book uses only two fonts - courier and times - for text. The fonts are used as
follows:
• The fIxed width courier font is used for Java source code. SpecifIcally, Java
classes and methods are displayed in the font. For example, the Java source
code for class Person is shown in courier as
Class Person {
String name, address, telephonei
• Running text is displayed in times font. Emphasized words and Java expres
sions in running text are italicized. For example, the identifIer for instance
variable name defmed in the above Person class is displayed as name in the
running text.
Preface IX
yes yes
Chapter 7 Chapter 8
Linear Data Structures Trees
yes yes
Chapter 9 Chapter 10
Graphs Network Flows
Fig. 3 Roadmap for Part III
Programs
All the Java source code listed inside the book is in
cluded in the CD of the book. The Java classes can be
copied to a hard-drive disk and compiled with the Java yes
compiler. For example, the Java file Customer java for
Example 1.1 can be compiled by issuing command
Chapter 11
javac Customer java Object Serialization
in the directory the contains the file. After compilation,
the main method in the class can be executed with
command
java Customer
Compiled bytecode for the example classes is also in
cluded in the CD. A reader can run a compiled main
method before compiling the source code.
The Java source code was prepared with Sun's
JDK 1.1, which includes a Java compiler and a runtime yes
system. Visit Sun's Web site at http://java.sun.com for
information on the latest release of Sun's JDK for a
Chapter 12
platform. Because of backward compatibility, the Data Structure Serialization
source code provided in the CD of the book can be
compiled and run with later releases of Sun's JDK. The
Fig. 4 Roadmap for Part IV
X Preface
author of the book will make efforts in updating the book to keep pace with the
rapid development of Java.
