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

Mark A. Weiss (Author)

Book Description

Publication Date: March 3, 2006 | ISBN-10: 0321370139 | ISBN-13: 978-0321370136 | Edition: 2nd

In this text, readers are able to look at specific problems and see how careful implementations can reduce the time constraint for large amounts of data from several years to less than a second. This new edition contains all the enhancements of the new Java 5.0 code including detailed examples and an implementation of a large subset of the Java 5.0 Collections API. This text is for readers who want to learn good programming and algorithm analysis skills simultaneously so that they can develop such programs with the maximum amount of efficiency. Readers should have some knowledge of intermediate programming, including topics as object-based programming and recursion, and some background in discrete math.

Editorial Reviews

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.

About the Author

Mark Allen Weiss is Professor and Associate Director for the School of Computing and Information Sciences at Florida International University. He is also currently serving as both Director of Undergraduate Studies and Director of Graduate Studies. 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. He is most well-known for his highly-acclaimed Data Structures textbooks, which have been used for a generation by roughly a million students.

Professor Weiss is the author of numerous publications in top-rated journals and was recipient of the University’s Excellence in Research Award in 1994. In 1996 at FIU he was the first in the world to teach Data Structures using the Java programming language, which is now the de facto standard. From 1997-2004 he served as a member of the Advanced Placement Computer Science Development Committee, chairing the committee from 2000-2004. The committee designed the curriculum and wrote the AP exams that were taken by 20,000 high school students annually.

In addition to his Research Award in 1994, Professor Weiss is also the recipient of the University’s Excellence in Teaching Award in 1999 and the School of Computing and Information Science Excellence in Teaching Award (2005) and Excellence in Service Award (2007).

--This text refers to an alternate Hardcover edition.

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.3 out of 5 stars  See all reviews (19 customer reviews)
• Amazon Best Sellers Rank: #81,701 in Books (See Top 100 in Books)
  • #9 in Books > Computers & Technology > Programming > Algorithms > Data Structures
  • #49 in Books > Computers & Technology > Computer Science > Systems Analysis & Design

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.