WIE Data Structures and Algorithms in Java

Michael T. Goodrich

681 pages, parution le 26/01/2004 (3^eme édition)

Ajouter à une liste

Indisponible

Résumé

The third edition of this conceptually elegant and pedagogically innovative text continues to incorporate the object-oriented design paradigm, using Java as the implementation language, while also providing intuition and analysis of fundamental data structures and algorithms. All of this is done in a clear, friendly writing style that uses visuals to introduce and simplify important analytic and mathematical concepts.

Entirely new chapter on recursion
Additional exercises on the analysis of simple algorithms
New case study on parenthesis matching and HTML validation

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.

Sommaire

Java programming
Object-oriented design
Analysis Tools
Stacks, Queues and Recursion
Vectors, lists and Sequences
Trees
Priority Queues
Maps and Dictionaries
Search Trees
Sorting, Sets and Selection
Text Processing
Graphs
A Useful Mathemetics Facts
Index

Voir tout

Replier

Caractéristiques techniques

	PAPIER
Éditeur(s)	Wiley
Auteur(s)	Michael T. Goodrich
Parution	26/01/2004
Édition	3^eme édition
Nb. de pages	681
Format	19,5 x 24
Couverture	Relié
Poids	1270g
Intérieur	Noir et Blanc
EAN13	9780471644521
ISBN13	978-0-471-64452-1