Data Structures and Problem Solving Using Java / Edition 4

Hardcover (Print)
Rent
Rent from BN.com
$48.19
(Save 69%)
Est. Return Date: 09/23/2014
Buy Used
Buy Used from BN.com
$95.62
(Save 39%)
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 $94.00
Usually ships in 1-2 business days
(Save 40%)
Other sellers (Hardcover)
  • All (29) from $94.00   
  • New (11) from $142.71   
  • Used (18) from $94.00   

Overview

Data Structures and Problem Solving Using Java takes a practical and unique approach to data structures that separates interface from implementation. It is suitable for the second or third programming course.

This book provides a practical introduction to data structures with an emphasis on abstract thinking and problem solving, as well as the use of Java. It does this through what remains a unique approach that clearly separates each data structure’s interface (how to use a data structure) from its implementation (how to actually program that structure). Parts I (Tour of Java), II (Algorithms and Building Blocks), and III (Applications) lay the groundwork by discussing basic concepts and tools and providing some practical examples, while Part IV (Implementations) focuses on implementation of data structures. This forces the reader to think about the functionality of the data structures before the hash table is implemented.

The Fourth Edition features many new updates as well as new exercises.

Read More Show Less

Product Details

  • ISBN-13: 9780321541406
  • Publisher: Prentice Hall
  • Publication date: 10/29/2009
  • Series: Alternative eText Formats Series
  • Edition description: New Edition
  • Edition number: 4
  • Pages: 1024
  • Sales rank: 621,494
  • Product dimensions: 7.40 (w) x 9.10 (h) x 1.60 (d)

Meet the Author

Mark Allen Weiss is a Professor in the School of Computing and Information Sciences at Florida International University in Miami Florida. He received his Bachelor's Degree in Electrical Engineering from The Cooper Union in 1983, and his Ph.D. in Computer Science from Princeton University in 1987, working under Bob Sedgewick. He has been at FIU since 1987, and was promoted to Professor in 1996. His interests include data structures, algorithms, and education, and he is most well-known for his highly-acclaimed Data Structures textbooks, which have been used at hundreds of universities worldwide.
Read More Show Less

Table of Contents

PART ONE: TOUR OF JAVA

Chapter 1: Primitive Java

Chapter 2: Reference Types

Chapter 3: Objects and Classes

Chapter 4: Inheritance

PART TWO: ALGORITHMS AND BUILDING BLOCKS

Chapter 5: Algorithm Analysis

Chapter 6: The Collections API

Chapter 7: Recursion

Chapter 8: Sorting Algorithms

Chapter 9: Randomization

PART THREE: APPLICATIONS

Chapter 10: Fun and Games

Chapter 11: Stacks and Compilers

Chapter 12: Utilities

Chapter 13: Simulation

Chapter 14: Graphs and Paths

PART FOUR: IMPLEMENTATIONS

Chapter 15: Inner Classes and Implementation of ArrayList

Chapter 16: Stacks and Queues

Chapter 17: Linked Lists

Chapter 18: Trees

Chapter 19: Binary Search Trees

Chapter 20: Hash Tables

Chapter 21: A Priority Queue: The Binary Heap

PART FIVE: ADVANCED DATA STRUCTURES

Chapter 22: Splay Trees

Chapter 23: Merging Priority Queues

Chapter 24: The Disjoint Set Class

APPENDIX A: Operators

APPENDIX B: Graphical User Interfaces

APPENDIX C: Bitwise Operators

Read More Show Less

Customer Reviews

Average Rating 4
( 7 )
Rating Distribution

5 Star

(3)

4 Star

(2)

3 Star

(1)

2 Star

(0)

1 Star

(1)

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
Sort by: Showing all of 6 Customer Reviews
  • Anonymous

    Posted December 22, 2001

    A great book

    This book strikes an excellent balance between theory and practice in a subject which can get complex very easily. The first book I attempted to read on this subject was the 'art of computer programming' of Don Knuth but it was too intimidating. Then i went to Algorithm with Java of Bob sedgewick and though it was excellent, the author did not worry about the specific java details. Finally, I get this book and I could understand very well the theoretical aspects of the subject as well as several practical implementation in java which help to clarify many subtleties involved in the algorithms I strongly recommend this book to people that are practical oriented but at the same time want adquire a firm grasp of the subject

    Was this review helpful? Yes  No   Report this review
  • Anonymous

    Posted October 9, 2000

    Very Confusing for most people.

    This book is very confusing for an average user. The codes are not easy to follow. He tends to make the code look more like industry codes, rather than codes for users and students to easily understand. Other than that , this book is very good if you are a serious java programmer. This book is not good for CSC Students though.

    Was this review helpful? Yes  No   Report this review
  • Anonymous

    Posted June 21, 2000

    Outstanding Data Structures/Java book

    Very good book for serious students, detailed description of Data Structures. Elaborates on Java language structure and allows for a very clear, consise understanding of Java and Data Structures.

    Was this review helpful? Yes  No   Report this review
  • Anonymous

    Posted March 6, 2000

    Don't waste your money.

    Extremely confusing and poorly organized book. Vague explanations are unacceptable for the CS course textbook. Probably the worst book on the subject.

    Was this review helpful? Yes  No   Report this review
  • Anonymous

    Posted March 5, 2000

    A beautiful Job

    This book has one of the most decent treatment of the theory behind recursion that I have ever seen. It gives a solid and clear idea of how algorithms are assembled. and allows us to fully appreciate the advantages of the object oriented languages this book is excellent for serious students who are concerned with a general way of logical thinking that enable them to extrapolate easily to any enviroment or language.

    Was this review helpful? Yes  No   Report this review
  • Anonymous

    Posted February 25, 2010

    No text was provided for this review.

Sort by: Showing all of 6 Customer Reviews

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