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 - 2003

by Goodrich, Michael T.; Tamassia, Roberto

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

Description

Wiley. 3. 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$26.13
Free Delivery within USA
Standard delivery: 7 to 14 days
More delivery options
Ships from BooksRun (Pennsylvania, United States)

Details

  • Title Data Structures and Algorithms in Java
  • Author Goodrich, Michael T.; Tamassia, Roberto
  • Binding Hardback
  • Edition 3
  • Condition Used - Very good
  • Pages 704
  • Volumes 1
  • Language ENG
  • Publisher Wiley, Hoboken, New Jersey, U.S.A
  • Publication date December 10, 2003
  • Illustrated Yes
  • Bookseller's Inventory # 0471469831-11-1
  • ISBN 9780471469834 / 0471469831
  • Weight 2.79 lbs (1.27 kg)
  • Dimensions 9.46 x 7.78 x 1.26 in (24.03 x 19.76 x 3.20 cm)
  • Category Computers - Languages / Programming
  • Library of Congress subjects Data structures (Computer science), Java (Computer program language)
  • Library of Congress Catalogue Number 2003071070
  • Dewey Decimal Code 005.73
  • 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

From the publisher

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

About the author

Professors 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 awards in this capacity. His teaching style is to involve the students in lively interactive classroom sessions 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.

The 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.

tracking-