Data Structures and Algorithms in Java

Updated for Java 5.0

Michael T. Goodrich, Roberto Tamassia

696 pages, parution le 30/08/2005 (4^eme édition)

Ajouter à une liste

Indisponible

Résumé

Fundamental data structures in a consistent object-oriented framework

Now revised to reflect the innovations of Java 5.0, Goodrich and Tamassia's Fourth Edition of Data Structures and Algorithms in Java continues to offer accessible coverage of fundamental data structures, using a consistent object-oriented framework. 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.

Key Features of the Fourth Edition:

Updates to Java 5.0 include new sections on generics and other Java 5.0 features, and revised code fragments, examples, and case studies to conform to Java 5.0.
Hundreds of exercises, including many that are new to this edition, promote creativity and help readers learn how to think like programmers and reinforce important concepts.
New case studies illustrate topics such as web browsers, board games, and encryption.
A new early chapter covers Arrays, Linked Lists, and Recursion.
A new final chapter on Memory covers memory management and external memory data structures and algorithms.
Java code examples are used extensively, with source code provided on the website.
Online animations and effective in-text art illustrate data structures and algorithms in a clear, visual manner.

Access additional resources on the web www.wiley.com/college/goodrich):

Java source code for all examples in the book
Animations
Library (net.datastructures) of Java constructs used in the book
Problems database and search engine
Student hints to all exercises in the book
Instructor resources, including solutions to selected exercises
Lecture slides

L'auteur - Michael T. Goodrich

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 University of California, Irvine. Previously, he was a professor at Johns Hopkins University. He is an editor for the International Journal of Computational Geometry & Applications and Journal of Graph Algorithms and Applications.

L'auteur - Roberto Tamassia

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 editor-in-chief for the Journal of Graph Algorithms and Applications and an editor for Computational Geometry: Theory and Applications. he previously served on the editorial board of IEEE Transactions on Computers.

Sommaire

Java Programming Basics
Object-Oriented Design
Arrays, Linked Lists, and Recursion
Analysis Tools
Stacks and Queues
Lists and Iterators
Trees
Priority Queues
Maps and Dictionaries
Search Trees
Sorting, Sets, Selection
Text Processing
Graphs
Memory
A: Useful Mathematical Facts
Bibliography
Index

Voir tout

Replier

Caractéristiques techniques

	PAPIER
Éditeur(s)	Wiley
Auteur(s)	Michael T. Goodrich, Roberto Tamassia
Parution	30/08/2005
Édition	4^eme édition
Nb. de pages	696
Format	19 x 24
Couverture	Relié
Poids	1277g
Intérieur	2 couleurs
EAN13	9780471738848
ISBN13	978-0-471-73884-8