Data Structures and Algorithm Analysis in Java [Hardcover]

Mark Allen Weiss (Author)

Book Description

ISBN-10: 0201357542 | ISBN-13: 978-0201357547 | Publication Date: October 1, 1998 | Edition: US ed

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. Included are algorithm and design techniques and amortized analysis, plus a new chapter on advanced data structures and their implementation.

Editorial Reviews

From the Back Cover

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.

0201357542B04062001

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.

0201357542AB04062001

Product Details

• Hardcover: 560 pages
• Publisher: Addison Wesley; US ed edition (October 1, 1998)
• Language: English
• ISBN-10: 0201357542
• ISBN-13: 978-0201357547
• Product Dimensions: 9.5 x 7.7 x 1 inches
• Shipping Weight: 2.4 pounds
• Average Customer Review: 3.3 out of 5 stars  See all reviews (19 customer reviews)
• Amazon Best Sellers Rank: #669,075 in Books (See Top 100 in Books)
  • #65 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

37 of 39 people found the following review helpful:

3.0 out of 5 stars wow, the full power of Java, March 24, 1999

By 

Louis Yang [e-mail] (Los Angeles) - See all my reviews

This review is from: Data Structures and Algorithm Analysis in Java (Hardcover)

Hi, before I go any further, let me mention that I bought a slightly older edition - my edition has 542 pages - so it seems that the author is still working on the book. But the book shouldn't have changed much.

This is an advance book on Data Structures - the author waste no time with the basics (unlike lots of other data structure books that spends like 50 pages going over basic language elements like arrays)

Let me stress the fact that this is an advance book, containing material that's NOT typical of a second quarter data structure class. Topics like d-Heaps, Binomial Heaps, NP-Completeness, Deterministic Skip Lists, and get this JAVA 1.2 COLLECTION API! - These things are definitely not for beginners. DO NOT read this book until you understand basic data structures from some other book. Perhaps: "Data Structures & Algorithms in Java (Mitchell Waite Signature Series)"??

That's why in the title of this review, I said that the book unleashes the full power of Java. If we just stick to simple binary trees or the usual heaps, C++ is just as good as Java. Java can only really beat C++ when it's used for complicated object systems. So by spending about half of time on advance data structures, AND PROVIDING SO MUCH SOURCE CODE, this book reveals the full power of Java.

So that's the good part (well for some people) - this book really puts Java to work. Here's the bad part, the author is really smart but goes really fast. I never learned anything advanced in my first pass. If it's something new for me, I always have to reread a passage at least twice, and VERY SLOWLY too, to grasp the material. Well, hard things never come easily. Mr. Weiss (author), if you are reading this, more pictures would be nice.

Another thing that annoys me is the cost. Well, it seems all data structure books are expensive except for the "Data Structures & Algorithms in Java (Mitchell Waite Signature Series)" book. That's definitely the book to buy for most people.

Get the "Data Structures & Algorithms in Java (Mitchell Waite Signature Series)" book first. Then get this book if you want to learn more (OR JUST TO SEE THE SOURCE CODE AND CHEAT - that's why I bought the book. Well, that's cause I am too dumb/lazy to get the AVL trees to work. So I get the book and cheat!) One last time, the book is hard to understand (or is it just that the material is hard? or is it just me?).

16 of 18 people found the following review helpful:

5.0 out of 5 stars Excellent, but quite advanced, March 25, 1999

By A Customer

This review is from: Data Structures and Algorithm Analysis in Java (Hardcover)

As at least one previous reviewer has stressed, this is _not_ a book for beginners. It is also not necessarily a book for users who simply want access to algorithm code (although the code is excellent, easy to read, and fully Java-aware). However, for the advanced user, it does an excellent job of living up to its title, particularly in its analysis of various algorithms (as opposed to simply describing those algorithms and printing the code for them). It crams a lot of thought into 542 pages, but be prepared to take it all in slowly. This is no "Algorithms for Dummies" book, but it is the best book I have seen for algorithm development in Java, and one of the best I've seen that discusses algorithms in general.

8 of 10 people found the following review helpful:

4.0 out of 5 stars Good book although he has better, December 24, 2000

By 

Eytan Seidman (Seattle, WA USA) - See all my reviews
(REAL NAME)   

This review is from: Data Structures and Algorithm Analysis in Java (Hardcover)

Any time I attempt to learn a new programming language I buy two books. One is a book on the core language itself and the other a book on alogorithms. When I initially learned Java algorithms I bought Data Structures and Problem Solving Using Java which is also buy Weiss and which I highly recommend.

This book is really great because it goes beyond just coding and basic analysis and really shows rigorous analysis of every type of algorithm. So for instance in hashing it will go through linear and quadratic probing as well as double hashing. The problem with this book is that sometimes Weiss gives too much analysis and doesnt show good examples of how to make the code prove his mathematical conclusions. Overall though its a great book and I would definitely recommend it.