Data Structures and Problem Solving Using Java (3rd Edition) [Hardcover]

Mark Allen Weiss (Author)

Book Description

ISBN-10: 0321322134 | ISBN-13: 978-0321322135 | Publication Date: February 24, 2005 | Edition: 3

Data Structures and Problem Solving Using Java  3/e  provides a practical introduction to data structures from a viewpoint of abstract thinking and problem solving, and incorporates the enhancements of Java 5.0.  It includes coverage of generic programming, and content on the design of generic collection classes. This book is appropriate for readers who are familiar with basic Java programming concepts or are new to the language and want to learn how it treats data structures concepts.

Editorial Reviews

From the Back Cover

Features Contains extensive sample code using Java 1.1, which is available over the Internet and has been tested and reviewed by a professional programmer for accuracy. Provides an introduction to Java in Part I and also covers Graphical User Interfaces (GUI's) in an appendix. Includes pedagogical aids such as margin notes and comprehensive end-of-chapter material to help readers grasp challenging concepts. Offers flexibility in topic coverage by minimizing dependencies among the different chapters.

0201549913B04062001 --This text refers to an out of print or unavailable edition of this title.

About the Author

Mark Allen Weiss is a Professor in the School of Computer Science at Florida International University. He received his Ph.D. in Computer Science from Princeton University where he studied under Robert Sedgewick. Dr.Weiss has received FIU's Excellence in Research Award, as well as the Teaching Incentive Program Award, which was established by the Florida Legislature to recognize teaching excellence. Mark Allen Weiss is on the Advanced Placement Computer Science Development Committee. He is the successful author of Algorithms, Data Structures, and Problem Solving with C++ and the series Data Structures and Algorithm Analysis in Pascal, Ada, C, and C++, with Addison-Wesley. 0201549913AB04062001 --This text refers to an out of print or unavailable edition of this title.

Product Details

• Hardcover: 960 pages
• Publisher: Addison Wesley; 3 edition (February 24, 2005)
• Language: English
• ISBN-10: 0321322134
• ISBN-13: 978-0321322135
• Product Dimensions: 9.2 x 7.9 x 1.6 inches
• Shipping Weight: 3.7 pounds
• Average Customer Review: 2.8 out of 5 stars  See all reviews (31 customer reviews)
• Amazon Best Sellers Rank: #333,202 in Books (See Top 100 in Books)
  • #37 in Books > Computers & Technology > Programming > Algorithms > Data Structures

More About the Author

Discover books, learn about writers, read author blogs, and more.

Customer Reviews

Most Helpful Customer Reviews

12 of 12 people found the following review helpful:

2.0 out of 5 stars Good Code, Terrible Explanations, March 28, 2000

By A Customer

This review is from: Data Structures and Problem Solving Using Java (Hardcover)

I am using this book in a class on Data Structures and Algorithms. This book has a lot of material and code in it which makes it good. However, his explanations are terrible. They are ambiguous and unclear. If you can teach yourself from the code, then this is a good book for you. If your looking for clear explanations, look somewhere else.

17 of 20 people found the following review helpful:

4.0 out of 5 stars algorithms are primary, Java is secondary, July 27, 2005

By 

W Boudville (Terra, Sol 3) - See all my reviews
(VINE VOICE)    (TOP 1000 REVIEWER)    (HALL OF FAME REVIEWER)    (REAL NAME)   

This review is from: Data Structures and Problem Solving Using Java (3rd Edition) (Hardcover)

[A review of the THIRD EDITION 2005]

The book teaches two things. Algorithms that are very useful in computing. And how these can be coded in Java.

The explanation of the algorithms requires a reasonable amount of mathematical sophistication on your part. They all relate to discrete maths, and cover topics like sorting, random number generation and graphs. The complexity of the discussion is less than that in Knuth's "Art of Computer Programming". Perhaps more akin to Sedgewick or Aho's algorithms texts. There is a fair amount of abstraction that you'll have to deal with.

The other task in the book is explaining how Java is well suited in which to code these algorithms. Weiss also makes good use of the Java interface ability. If you think of an algorithm as being implemented in a subroutine [ie. a procedural approach], then the book uses interfaces to let you design a program at a higher level, and making it quite modular and independent of specific implementations of given algorithms.

The book does deal with Java 5. But perhaps the most important aspect of Java used in the book is the interface. So the book is quite germane even if you are using an earlier Java.

But what if you program in another language? Is the book relevant? Quite possibly. Firstly, some other languages, like C#, have interfaces. More importantly, if you regard the algorithms as the most important aspect of the book, and you are a skilled programmer, then coding is the easier aspect.

A remark to a lecturer: If you are teaching a course and are contemplating this book as its text, be careful. Try to ensure that the expected background of your class is compatible with the book. For example, if they will be experienced Java programmers, but have little maths knowledge (and this combination is certainly possible), then the book may not be very useful to them.

10 of 11 people found the following review helpful:

5.0 out of 5 stars Great book!, November 19, 2005

By 

L. KENG "Truth Seeker" (Florida, USA) - See all my reviews
(REAL NAME)   

This review is from: Data Structures and Problem Solving Using Java (3rd Edition) (Hardcover)

I got the 2002 edition of this book for a class one and a half year ago. It is a great book. Yes, the book covers some of the basics of Java, then it goes into various analysis, algorithms, implementations, etc. It is not for beginners, and some math background will help tremendously. There is no way we could have covered all the topics in the book. It is simply too rich. It is very well written and contains great explanation. I especially like the Big Oh introduction. I found myself getting even more out of it every time I go back and read it again. Just like everything else in life, repitition is the key.