| Summaries and Customer Reviews are supplied by Amazon.com | 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 | Average Customer Rating: Because i can't give 0/5 stars... TERRIBLE text This text book is a terrible attempt at education. It lacks the code to demonstrate test drivers to help the learner understand how to apply any code snippets demonstrated, and also represents most of the material in garbled pseudo-code, instead of teaching from code itself.
I'm currently reading through chapter 9 - hash tables, and with the sheer lack of examples (the author thinks 3 paragraphs is enough to teach hash codes?) it makes it nearly impossible to understand this subject.
The approach the authors took in this text is to refresh the memory of the programmer who has already mastered the subject. This is NOT a text designed for those new to the subject.
Sadly, as long as educators keep falling for this hideous book, students will be continually required to spend their hard-earned cash and support the authors in this pathetic attempt at education.
One of the Best Data Structure Book Data Sturctures and Algorithms in Java is a great book for a Data Structure class for CS student. I go to a school where data structures is taught in C++. But i used this book to learn about most data structures. The explanations are very clear and detailed. I did not use the source code from this book as i had to program in C++ , however I used this book more than my assigned course book . I still use this book as reference . I really liked the chapter on Complexity . Very good explanation . This book covers all the topics in detail. I think it is a must for every CS student to have. A java Data Structures book This was a mediocre text that is a rewrite of the same text in C++. As is common, the book reads like it was updated by search and replace. Okay book... This is for the fourth edition, which from other reviews doesn't suck as bad as the first two...
It's an okay text book - but I pity anybody who doesn't have either experiance working with data structures in C or C++ OR who hasn't taken a Finite Math class specifically for CS.
Only get it because you need it for a course, spend as little as possible and then dump it on eBay as quick as you can. Not worth keeping as a reference. Ostentatiously Bad This book, as many have said, is used in numerous introductory courses in computer science. It was recently dropped by my college after it was disowned by the professors who chose it -- we students threw so much scorn on the book no one wanted to admit they had anything to do with it.
The book has a very idiosyncratic style. It likes to use some unnecessarily specific class and method names for its examples (e.g. The authors create a binary node class -- BTNode -- for you and then never use it, but go back to their BTPosition class) and fails nearly every time when it attempts to justify certain proofs about big-O and algorithm runtimes. In fact, the authors seem to think it adequate to make a broad statement and then give a simple example.
All in all, you're best finding webpages written by random professors than purchasing this morass. | |