Tài liệu Data Structures and Algorithms in Java

Preface to the Fourth Edition
This fourth edition is designed to provide an introduction to data structures and
algorithms, including their design, analysis, and implementation. In terms of curricula
based on the IEEE/ACM 2001 Computing Curriculum, this book is appropriate for
use in the courses CS102 (I/O/B versions), CS103 (I/O/B versions), CS111 (A
version), and CS112 (A/I/O/F/H versions). We discuss its use for such courses in
more detail later in this preface.
The major changes, with respect to the third edition, are the following:
ã Added new chapter on arrays, linked lists, and recursion.
ã Added new chapter on memory management.
ã Full integration with Java 5.0.
ã Better integration with the Java Collections Framework.
ã Better coverage of iterators.
ã Increased coverage of array lists, including the replacement of uses of the class
java.util.Vector with java.util.ArrayList.
ã Update of all Java APIs to use generic types.
ã Simplified list, binary tree, and priority queue ADTs.
ã Further streamlining of mathematics to the seven most used functions.
ã Expanded and revised exercises, bringing the total number of reinforcement,
creativity, and project exercises to 670. Added exercises include new projects on
maintaining a game's high-score list, evaluating postfix and infix expressions,
minimax game-tree evaluation, processing stock buy and sell orders, scheduling
CPU jobs, n-body simulation, computing DNA-strand edit distance, and creating
and solving mazes