Data Structures and Algorithms in Java Hardcover – Aug 24 2005
Customers Who Bought This Item Also Bought
No Kindle device required. Download one of the Free Kindle apps to start reading Kindle books on your smartphone, tablet, and computer.
To get the free app, enter your e-mail address or mobile phone number.
From the Back Cover
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
- 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
About the Author
Professor Goodrich and Tamassia are well-recognized researchers in algorithms and data structures, having published many papers in this field, with applications to Internet computing, information visualization, computer security, and geometric computing. they have served as principal investigators in several joint projects sponsored by the National Science Foundation, the Army Research Office, and the Defense Advanced research Projects Agency. They are also active in educational technology research, with special emphasis on algorithm visualization systems.
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.
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.
In addition to their research accomplishments, the authors also have extensive experience in the classroom. For example, Dr. Goodrich has taught data structures and algorithms courses, including Data Structures as a freshman-sophomore level course and Introduction to Algorithms as an upper level course. He has earned several teaching wards in this capacity. His teaching style is to involve the students in lively interactive classroom session that bring out the intuition and insights behind data structuring and algorithmic techniques. Dr. Tamassia has taught Data Structures and Algorithms as an introductory freshman-level course since 1988. One thing that has set his teaching style apart is his effective use of interactive hypermedia presentations integrated with the Web.
This instructional Web sites, datastructures.net and algorithmdesign.net, supported by Drs. Goodrich and Tamassia, are used as reference material by students, teachers, and professionals worldwide.
Inside This Book(Learn More)
Building data structures and algorithms requires that we communicate detailed instructions to a computer, and an excellent way to perform such communication is using a high-level computer language, such as Java. Read the first page
Front Cover | Copyright | Table of Contents | Excerpt | Index | Back Cover
Top Customer Reviews
Code was usually broken down into two parts: clear and concise pseudo-code (Python-like) and then large sections of poorly formatted and sometimes erroneous Java.
As a book meant to introduce readers to abstract data types and algorithms, I felt that this book assumed too much by acting as a reference for the initiated rather than a guide for newcomers.
Most Helpful Customer Reviews on Amazon.com (beta)
So, I've been marking them in my copy, in order to submit them to the authors or publisher, but apparently they don't want to know about the typos. The "errata" section at java.datastructures.net contains no errata and no instructions on how to submit errata. I wrote to one of the authors to ask how to submit errata, but received no reply.
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.
My recommendation is to seek other data structure courses if the one you are considering uses this book. If you have no other choice, be prepared to pick up another book. I need to write both a final programming assignment and a final project that uses a Binary Search Tree data structure. I cannot complete my tasks using this book as a reference. I ordered "Data Structures and Algorithms in Java (2nd Edition)" by Lafore - ISBN-10: 0672324539; ISBN-13: 978-0672324536.
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.
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.
Look for similar items by category
- Books > Computers & Technology > Computer Science
- Books > Computers & Technology > Programming > Algorithms
- Books > Computers & Technology > Programming > Java
- Books > Computers & Technology > Programming > Languages & Tools
- Books > Computers & Technology > Programming > Software Design, Testing & Engineering > Structured Design
- Books > Qualifying Textbooks - Fall 2007 > Computers & Internet
- Books > Textbooks > Computer Science & Information Systems > Programming Languages