Data Structures and Algorithm Analysis in Java / Edition 2

Paperback (Print)
Rent
Rent from BN.com
$35.60
(Save 75%)
Est. Return Date: 12/23/2014
Buy New
Buy New from BN.com
$115.32
Buy Used
Buy Used from BN.com
$94.38
(Save 34%)
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 $8.51
Usually ships in 1-2 business days
(Save 94%)
Other sellers (Paperback)
  • All (18) from $8.51   
  • New (4) from $16.03   
  • Used (14) from $8.51   

Overview

Mark Allen Weiss provides a proven approach to algorithms and data structures using the exciting Java programming language as the implementation tool. With Java he highlights conceptual topics, focusing on ADTs and the analysis of algorithms for efficiency as well as performance and running time. Dr. Weiss also distinguishes this text with a logical organization of topics, his engaging writing style, and an extensive use of figures and examples showing the successive stages of an algorithm.

Features:

  • Contains extensive sample code using Java 1.2, which is available over the Internet.
  • Covers the Java Collections Library in an appendix.
  • Includes a chapter on algorithm and design techniques that covers greedy algorithms, divide-and-conquer algorithms, dynamic programming, randomized algorithms, and backtracking.
  • Presents current topics and new data structures such as Fibonacci heaps, skew heaps, binomial queues, skip lists, and splay trees.
  • Offers a chapter on amortized analysis that examines the advanced data structures presented earlier in the book.
  • Provides a chapter on advanced data structures and their implementation, covering red-black trees, top-down splay trees, treaps, k-d trees, pairing heaps, and more.
Read More Show Less

Editorial Reviews

Booknews
This textbook for either an advanced data structures course or a first-year graduate course in algorithm analysis describes data structures--methods of organizing large amounts of data--and algorithm analysis--the estimation of the running time of algorithms. Weiss (computer science, Florida International U.) includes chapters on trees, hash tables, priority queues, sorting, the disjoint set algorithm, graph algorithms, algorithm design techniques, amortized analysis, and search tree algorithms, the k-d tree and the pairing heap. Annotation c. by Book News, Inc., Portland, Or.
Read More Show Less

Product Details

  • ISBN-13: 9780321370136
  • Publisher: Addison Wesley
  • Publication date: 3/3/2006
  • Edition description: REV
  • Edition number: 2
  • Pages: 576
  • Sales rank: 1,152,224
  • Product dimensions: 7.73 (w) x 9.55 (h) x 0.99 (d)

Table of Contents

Ch. 1 Introduction 1
Ch. 2 Algorithm analysis 29
Ch. 3 Lists, stacks, and queues 57
Ch. 4 Trees 101
Ch. 5 Hashing 169
Ch. 6 Priority queues (heaps) 201
Ch. 7 Sorting 247
Ch. 8 The disjoint set class 293
Ch. 9 Graph algorithms 317
Ch. 10 Algorithm design techniques 385
Ch. 11 Amortized analysis 465
Ch. 12 Advanced data structures and implementation 491
Read More Show Less

Customer Reviews

Be the first to write a review
( 0 )
Rating Distribution

5 Star

(0)

4 Star

(0)

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)