Data Structures and Algorithm Analysis in Java (2nd Edition) (Hardcover)

~ (Author)

Editorial Reviews

Product Description

As the speed and power of computers increases, so does the need for effective programming and algorithm analysis. By approaching these skills in tandem, Mark Allen Weiss teaches readers to develop well-constructed, maximally efficient programs in Java. A full language update to Java 5.0 throughout the text--particularly its use of generics-adds immeasurable value to this advanced study of data structures and algorithms. This Second Edition features integrated coverage of the Java Collections Library as well as a complete revision of lists, stacks, queues, and trees. Weiss clearly explains topics from binary heaps to sorting to NP-completeness, and dedicates a full chapter to amortized analysis and advanced data structures and their implementation. Figures and examples illustrating successive stages of algorithms contribute to Weiss' careful, rigorous and in-depth analysis of each type of algorithm. A logical organization of topics and full access to source code compliment the text's coverage.

From the Back Cover

Advanced Data Structures/Algorithms Java

 

Data Analysis and Algorithm Analysis in Java, 2/e

Mark Allen Weiss, Florida International University

ISBN : 0-321-37013-9

 

As the speed and power of computers increase, so does the need for effective programming and algorithm analysis. Mark Allen Weiss approaches these skills jointly to teach the development of well-constructed, maximally efficient programs in Java.

 

Readers benefit from the full language update to Java 5.0, including generics, and the integrated coverage of the Java Collections Library in this advanced study of data structures and algorithms. Weiss clearly explains his careful, rigorous and in-depth analysis of each type of algorithm.

 

This Second Edition features:

 

• Full integration of the new Java 5.0 programming language and the Java Collections Library

 

• Enhanced interior design, with figures and examples illustrating successive stages of algorithms

 

• Completely revised coverage of lists, stacks, and queues in Chapter 3

 

• Full chapter dedicated to the implementation of amortized analysis and advanced data structures

 

• End-of-chapter exercises, ranked by difficulty, reinforce key chapter concepts

 

 

 

Visit aw.com/computing for more information about Addison-Wesley computing books.

See all Editorial Reviews

Product Details

• Hardcover: 576 pages
• Publisher: Addison Wesley; 2nd edition (March 3, 2006)
• Language: English
• ISBN-10: 0321370139
• ISBN-13: 978-0321370136
• Product Dimensions: 9.3 x 7.1 x 1 inches
• Shipping Weight: 1.8 pounds (View shipping rates and policies)
• Average Customer Review: 3.2 out of 5 stars  See all reviews (19 customer reviews)
• Amazon.com Sales Rank: #222,135 in Books (See Bestsellers in Books)

  Popular in these categories: (What's this?)

  #6 in	Books > Computers & Internet > Programming > Algorithms > Data Structures
  #9 in	Books > Computers & Internet > Databases > Java & Databases
  #96 in	Books > Computers & Internet > Software > Mathematical & Statistical

Customer Reviews

Most Helpful Customer Reviews

32 of 34 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?).

13 of 15 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 25, 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.