Data Structures and Problem Solving Using Java / Edition 1

Hardcover (Print)
Used and New from Other Sellers
Used and New from Other Sellers
from $1.99
Usually ships in 1-2 business days
(Save 97%)
Other sellers (Hardcover)
  • All (20) from $1.99   
  • New (2) from $58.77   
  • Used (18) from $1.99   
Sort by
Page 1 of 1
Showing All
Note: Marketplace items are not eligible for any coupons and promotions
Seller since 2008

Feedback rating:



New — never opened or used in original packaging.

Like New — packaging may have been opened. A "Like New" item is suitable to give as a gift.

Very Good — may have minor signs of wear on packaging but item works perfectly and has no damage.

Good — item is in good condition but packaging may have signs of shelf wear/aging or torn packaging. All specific defects should be noted in the Comments section associated with each item.

Acceptable — item is in working order but may show signs of wear such as scratches or torn packaging. All specific defects should be noted in the Comments section associated with each item.

Used — An item that has been opened and may show signs of wear. All specific defects should be noted in the Comments section associated with each item.

Refurbished — A used item that has been renewed or updated and verified to be in proper working condition. Not necessarily completed by the original manufacturer.


Ships from: Chicago, IL

Usually ships in 1-2 business days

  • Standard, 48 States
  • Standard (AK, HI)
Seller since 2005

Feedback rating:


Condition: New
1997 Hard cover Illustrated. New. No dust jacket as issued. Sewn binding. Paper over boards. 779 p. Contains: Illustrations.

Ships from: San Marino, CA

Usually ships in 1-2 business days

  • Canadian
  • International
  • Standard, 48 States
  • Standard (AK, HI)
  • Express, 48 States
  • Express (AK, HI)
Page 1 of 1
Showing All
Sort by


"The book's unique approach of separating the interface (how to use a data structure) and the implementation (how to program a structure) of each data structure into parts has been hailed by both professors and students as an outstanding and efficient way of teaching data structures. Professor Mark Allen Weiss continues with this approach in the third edition of Data Structures and Problem Solving Using Java by introducing concepts in four parts. Part 1 (tour of Java), Part 2 (Algorithms and Building Blocks), and Part 3 (Applications) lay the groundwork by discussing basic concepts and tools and providing some practical examples. Implementation of data structures is not shown until Part 4 (Implementations). This practical approach forces the student to think abstractly about the functionality of the data structures before implementing them." This edition incorporates the many enhancements of Java 5.0. It includes coverage of generic programming and of the design of generic collection classes. The book is appropriate for students who are familiar with basic Java programming concepts or are new to the language and want to learn how it treats data structures concepts.
Read More Show Less

Product Details

  • ISBN-13: 9780201549911
  • Publisher: Addison-Wesley
  • Publication date: 10/16/1997
  • Edition description: Older Edition
  • Edition number: 1
  • Pages: 780
  • Product dimensions: 7.64 (w) x 9.46 (h) x 1.34 (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

Ch. 1 Primitive Java 3
Ch. 2 Reference types 27
Ch. 3 Objects and classes 63
Ch. 4 Inheritance 93
Ch. 5 Algorithm analysis 163
Ch. 6 The collections api 201
Ch. 7 Recursion 251
Ch. 8 Sorting algorithms 303
Ch. 9 Randomization 343
Ch. 10 Fun and games 367
Ch. 11 Stacks and compilers 389
Ch. 12 Utilities 419
Ch. 13 Simulation 451
Ch. 14 Graphs and paths 471
Ch. 15 Inner classes and implementation of ArrayList 517
Ch. 16 Stacks and queues 539
Ch. 17 Linked lists 563
Ch. 18 Trees 595
Ch. 19 Binary search trees 629
Ch. 20 Hash tables 713
Ch. 21 A priority queue : the binary heap 745
Ch. 22 Splay trees 781
Ch. 23 Merging priority queues 809
Ch. 24 The disjoint set class 831
App. A Operators 865
App. B Graphical user interfaces 867
App. C Bitwise operators 897
Read More Show Less

Customer Reviews

Average Rating 4
( 7 )
Rating Distribution

5 Star


4 Star


3 Star


2 Star


1 Star


Your Rating:

Your Name: Create a Pen Name or

Barnes & 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 & 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 & 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 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


  • - By submitting a review, you grant to Barnes & and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Terms of Use.
  • - Barnes & reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & 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 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)