Data Structures and Algorithm Analysis in Java (3rd Edition)

Data Structures and Algorithm Analysis in Java (3rd Edition)

Authors	Year	Pages	Publisher	Dimensions, inch.	File type	Size, Mb	First 20 pages
Mark A. Weiss	2011	636	Addison Wesley; 3rd Edition	7.02х9.06	PDF	5	First 20 pages

Book Description
Data Structures and Algorithm Analysis in Java is an “advanced algorithms” book that fits between traditional CS2 and Algorithms Analysis courses. In the old ACM Curriculum Guidelines, this course was known as CS7. 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.

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.

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 complement the text’s coverage.

Detailed explanation: ID 10015

Editorial Reviews
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. --This text refers to an out of print or unavailable edition of this title.

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).


Most Helpful Customer Reviews
wow, the full power of Java March 24, 1999
By Louis Yang louyang@ucla.edu

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?).

Excellent, but quite advanced March 25, 1999
By A Customer

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.

Data Structures & Algorithm Analysis in Java August 27, 2001
By Thomas Jones

I give this book only 2 stars. This book is not for students taking their first course in data structures. However, I first encountered it as a required text for an introductory Data Structures course that I took. This book is not an easy nor an enjoyable read. It does not contain nearly enough visual aides i.e., graphics, screen shots, diagrams to help a reader develop a mental image of abstract data structures. It is far too technical to be used as an introductory text to Data Structures. It is a colorless, lifeless presentation of a subject that actually can be quite fun and interesting. How can a book on Data Structure be fun or interesting...Please see my review of "Data Structures And Algorithms in Java" by Robert LaFore. Mr. Lafore's book is OUTSTANDING! It has great graphics, simple explanations, a great Table of Contents, and Index. I bought it and it was instrumental in my getting a "A" in the course. I recommend you buy it instead of Mr. Weiss's product.

Detailed explanation: ID 10015