About the Authors Use as a Textbook Prerequisites

Acknowledgments

For the Instructor Web Added-Value Education Data Structures in Java

This second edition is designed to provide a comprehensive introduction to data structures and algorithms, including their design, analysis, and implementation. In terms of the computer science and computer engineering curricula, we have written this book to be primarily focused on the Freshman-Sophomore level Data Structures (CS2) course.

Several changes have been incorporated into this second edition. The introductory Chapters 1 and 2 were added to provide a stronger background in object-oriented programming, and to make the text more self-contained. In addition, the following changes were also made:

• Expanded discussion of object-oriented design and the Java programming language, including the Java Collections Framework and design patterns
• Expanded coverage of Internet-related algorithmic topics, including hashing and text processing
• Revised and expanded exercises and Java code examples
• Expanded accompanying Web site (http://www.wiley.com/college/cs2java/)
• More focused attention on the most-used data structures, including vectors, lists, hash tables, and search trees.

With the ever-increasing influence of the World Wide Web (WWW) and the Internet, the importance of data structure design principles has actually increased in the three years since we wrote the first edition. Given the powerful influence this medium is having on all areas of software engineering, we expect the central role of data structure design in the computer science and computer engineering curricula to remain strong, and even increase, in the years ahead. Indeed, we have revised and expanded our previous discussions on hashing and text processing to focus more on Internet applications of efficient data structures.

Note: The first edition of this book contained additional material more suitable for a Junior-Senior level Data Structures and Algorithms (CS7) course. Instructors interested in using the second edition for a CS7 course can augment it with the following supplemental materials available in the instructor area of this Web site:

• splay trees;
• range trees;
• partition trees;
• convex hulls;
• orthogonal segment intersection.

Alternatively, they can adopt the companion text, Algorithm Design, by the same authors.