Data Structures and Algorithms in Java / Edition 5

Hardcover (Print)
Rent
Rent from BN.com
$24.36
(Save 83%)
Est. Return Date: 06/17/2014
Buy Used
Buy Used from BN.com
$86.32
(Save 41%)
Item is in good condition but packaging may have signs of shelf wear/aging or torn packaging.
Condition: Used – Good details
Used and New from Other Sellers
Used and New from Other Sellers
from $37.72
Usually ships in 1-2 business days
(Save 74%)
Other sellers (Hardcover)
  • All (20) from $37.72   
  • New (10) from $37.72   
  • Used (10) from $45.85   

Overview

* This newest edition examines fundamental data structures by following a consistent object-oriented framework that builds intuition and analysis skills of data structures and algorithms
* Presents new figures, simpler language, and more practical motivations from real-world scenarios
* Numerous illustrations, Web-based animations, and simplified mathematical analyses help readers quickly learn important concepts

Read More Show Less

Editorial Reviews

Booknews
This text for a freshman-sophomore level (CS2) course introduces data structures and algorithms, including their design, analysis, and implementation. It incorporates the object-oriented design paradigm, using Java as the implementation language. Goodrich (computer science, Johns Hopkins U.) and Tamassia (computer science, Brown U.) explain the use of stacks, queues, deques, vectors, lists, sequences, trees, dictionaries, sorting, sets, selection, text processing, and graphs. Concepts in the text are further explained with illustrations, web- based animations, and simplified mathematical analyses. Readers should be somewhat familiar with a high level programming language. Included in the first edition, but absent from the second edition is material more suitable for a junior-senior level (CS7) course. Annotation c. Book News, Inc., Portland, OR (booknews.com)
Read More Show Less

Product Details

  • ISBN-13: 9780470383261
  • Publisher: Wiley, John & Sons, Incorporated
  • Publication date: 1/7/2010
  • Edition description: Fifth Edition
  • Edition number: 5
  • Pages: 714
  • Sales rank: 326,920
  • Product dimensions: 7.70 (w) x 9.30 (h) x 1.20 (d)

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

Read More Show Less

Table of Contents

1 Java programming basics 1
2 Object-oriented design 57
3 Arrays, linked lists, and recursion 95
4 Analysis tools 153
5 Stacks and queues 187
6 Lists and iterators 221
7 Trees 265
8 Priority queues 319
9 Maps and dictionaries 367
10 Search trees 417
11 Sorting, sets, and selection 487
12 Text processing 539
13 Graphs 579
14 Memory 649
Read More Show Less

Customer Reviews

Average Rating 4.5
( 2 )
Rating Distribution

5 Star

(1)

4 Star

(1)

3 Star

(0)

2 Star

(0)

1 Star

(0)

Your Rating:

Your Name: Create a Pen Name or

Barnes & Noble.com Review Rules

Our reader reviews allow you to share your comments on titles you liked, or didn't, with others. By submitting an online review, you are representing to Barnes & Noble.com that all information contained in your review is original and accurate in all respects, and that the submission of such content by you and the posting of such content by Barnes & Noble.com does not and will not violate the rights of any third party. Please follow the rules below to help ensure that your review can be posted.

Reviews by Our Customers Under the Age of 13

We highly value and respect everyone's opinion concerning the titles we offer. However, we cannot allow persons under the age of 13 to have accounts at BN.com or to post customer reviews. Please see our Terms of Use for more details.

What to exclude from your review:

Please do not write about reviews, commentary, or information posted on the product page. If you see any errors in the information on the product page, please send us an email.

Reviews should not contain any of the following:

  • - HTML tags, profanity, obscenities, vulgarities, or comments that defame anyone
  • - Time-sensitive information such as tour dates, signings, lectures, etc.
  • - Single-word reviews. Other people will read your review to discover why you liked or didn't like the title. Be descriptive.
  • - Comments focusing on the author or that may ruin the ending for others
  • - Phone numbers, addresses, URLs
  • - Pricing and availability information or alternative ordering information
  • - Advertisements or commercial solicitation

Reminder:

  • - By submitting a review, you grant to Barnes & Noble.com and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Noble.com Terms of Use.
  • - Barnes & Noble.com reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & Noble.com also reserves the right to remove any review at any time without notice.
  • - See Terms of Use for other conditions and disclaimers.
Search for Products You'd Like to Recommend

Recommend other products that relate to your review. Just search for them below and share!

Create a Pen Name

Your Pen Name is your unique identity on BN.com. It will appear on the reviews you write and other website activities. Your Pen Name cannot be edited, changed or deleted once submitted.

 
Your Pen Name can be any combination of alphanumeric characters (plus - and _), and must be at least two characters long.

Continue Anonymously

    If you find inappropriate content, please report it to Barnes & Noble
    Why is this product inappropriate?
    Comments (optional)