BIBLIO is the largest independent book marketplace in the world, with over 100 million books.

Skip to content

Data Structures and Algorithms in Java

Data Structures and Algorithms in Java

Data Structures and Algorithms in Java
Stock photo: cover may vary

Data Structures and Algorithms in Java Hardback - 2005

by Goodrich, Michael T.; Tamassia, Roberto

Add to wish list
  • Used
  • very good
Used - Very good

Description

Wiley. 4. Very Good. It's a well-cared-for item that has seen limited use. The item may show minor signs of wear. All the text is legible, with all pages included. It may have slight markings and/or highlighting.
Ask the seller a question Add to wish list
A$18.25
Free Delivery within USA
Standard delivery: 7 to 14 days
More delivery options
Ships from BooksRun (Pennsylvania, United States)
The BIBLIO Guarantee

Details

  • Title Data Structures and Algorithms in Java
  • Author Goodrich, Michael T.; Tamassia, Roberto
  • Binding Hardback
  • Edition 4
  • Condition Used - Very good
  • Pages 720
  • Volumes 1
  • Language ENG
  • Publisher Wiley, Hoboken, NJ
  • Publication date August 24, 2005
  • Illustrated Yes
  • Bookseller's Inventory # 0471738840-11-6
  • ISBN 9780471738848 / 0471738840
  • Weight 2.8 lbs (1.27 kg)
  • Dimensions 9.4 x 7.64 x 1.27 in (23.88 x 19.41 x 3.23 cm)
  • Library of Congress subjects Data structures (Computer science), Java (Computer program language)
  • Library of Congress Catalogue Number 2005282681
  • Dewey Decimal Code 005.133
  • Quantity available 1

About BooksRun Pennsylvania, United States

Specialising in: Textbooks
Biblio member since 2016

BooksRun - best place to buy, sell or rent cheap textbooks

Terms of Sale:

30 days return guarantee. 10% restocking fee applies to discretionary returns

Browse books from BooksRun

Reader reviews for Data Structures and Algorithms in Java

Write a review for this book

There are no reviews for this book yet. Be the first to write a review!

Your review will be anonymous unless you login or create an account first.

Overall rating
Remember: You’re rating the book as a work, not the seller or the condition of the specific copy you purchased!

Important Terms and Guidelines

  • Please focus on the book’s content and context. Also, add any personal comments as to how you enjoyed the book. Substantiate your likes and dislikes. You may make comparisons to other books.
  • Reviews must be at least 140 characters in length.
  • Please do not reveal critical plot elements.
  • This is not a help line. Contact customer support if you need help.
Your review must not include:
  • Obscenities, discriminatory language, or other insulting language not suitable for public domain
  • Advertisements, “spam” content, or references to other products, offers or websites.
  • Email addresses, URLs, phone numbers, physical addresses or other contact information.
  • Overly critical comments about other reviews or reviewers
  • Time-sensitive material (i.e. promotional tours, seminars, lectures, etc.)
  • Availability, price, or alternative ordering/shipping information

From the publisher

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

First line

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.

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.

Please wait a moment while we load the requested page.

tracking-