Data Structures and Algorithms in Java: International Student Version
Data Structures and Algorithms in Java: International Student Version by Michael T. Goodrich and Roberto Tamassia
- Binding:
- Paperback
- Number of Pages:
- 720
- ISBN:
- 0470398809
- Product Group:
- book
- Publisher:
- John Wiley & Sons
- Publication Date:
- March 19, 2010
- BooksForGeeks.com ID:
- 1320
In this updated fifth edition, software engineers will find accessible coverage of fundamental data structures using a consistent object-oriented framework. The discussions throughout the book now feature the latest information on Java JDK 1.6.
Reviews for Data Structures and Algorithms in Java: International Student Version
-
Great for Practical Understanding of Algorithms
Rated out of 5 stars, July 12th, 2009
I found this book a great aid in getting to grips with many complex (and simple) algorithms such as implementation of stacks and queues with Java, and more complex stuff like trees and some basic understanding of design patterns. A good reference book for a Java programmer in my opinion, though I don't know what else is on the market particularly.
One book I found very good for the topic of algorithms was Algorithmics: The Spirit of Computing by Harel and Feldman. -
Poorly written
Rated out of 5 stars, June 12rd, 2006
Covers lots of subjects, but is badly explained/written. It reads like a mathematical school textbook from the 1950s, not untangling the problems into humanly understandable prose. -
Not even for 3rd yr Comp Sci Majors
Rated out of 5 stars, August 12st, 2001
I looked through this book to compare it to others I had seen and it is very hard to understand, even for me (a 3rd yr comp sci major who already understands this topic) -
This is fundamental stuff for efficient programming.
Rated out of 5 stars, January 12th, 2001
This book starts with an introduction on the concepts of algorithm runtime and memory space usage complexities. After this, the reader will discover, chapter by chapter, what the essence is of particular data structures, starting with stacks, queues, ... graphs, .. etc. Each of these abstract data types is mentioned with different implementations, pseudocode and/or java code. Besides the ADT's, some interesting patterns are discussed, also fundamental algorithm methods are explained in depth,s.a. divide-and-conquer, dynamic programming ... This book contains a lot of related topics, eg. computational geometry, sorting, ... Although, mathematical approaches are often used for analysing algorithms and structures, the book is still very readable. Code examples can be downloaded from the book's website.Franky Leeuwerck

