Data Structures and Algorithms in Java, Second Edition

A Clear, Visual Approach to Fundamental Data Structures and Algorithms

Goodrich and Tamassia's Data Structures and Algorithms in Java, 2/E, incorporates the object-oriented design paradigm, using Java as the implementation language. The authors provide intuition, description, and analysis of fundamental data structures and algorithms. Numerous illustrations, web-based animations, and simplified mathematical analyses justify important analytical concepts.

In the Second Edition, the authors have improved their text by simplifying advanced topics, including many new exercises, and revising most Java code examples. You'll also find updated and expanded coverage of Internet-related topics, object-oriented design, and the Java programming language, including the Collections Framework and Design Patterns.

Features

• Visual justifications help readers better understand difficult concepts.
• Object-oriented design patterns provide clear approaches for creating Java code.
• Randomization replaces complex average-case analysis of sophisticated data structures.
• Improved Web site, which includes:
• PILOT-An interactive system for visualizing, solving, and grading graph algorithm problems
• Java code examples
• A complete Java Software Library especially designed for a CS2 course
• A student hint server for selected exercises
• Numerous instructor courses

About the Authors

Professors Goodrich and Tamassia are well-recognized researchers in data structures and algorithms, having published many papers in this field, with applications to internet computing, information visualization, geographic information systems, computer security, and computer-aided layout.

Michael Goodrich received his Ph.D. in Computer Science from Purdue University in 1987. He is currently a professor in the Department of Computer Science at Johns Hopkins University, and codirector of the Johns Hopkins Center for Algorithm Engineering. He is an editor for the International Journal of Computational Geometry & Applications, Journal of computational and System Sciences, and Journal of Graph Algorithms and Applications.

Roberto Tamassia received his Ph.D. in Electrical and Computer Engineering from the University of Illinois at Urbana-Champaign in 1988. He is currently a professor in the Department of Computer Science at Brown University. He is also an editor for Computational Geometry: Theory and Applications, and the Journal of Graph Algorithms and Applications, and previously served on the editorial board of IEEE Transactions on computers.