Data Structures & Algorithms in Java (Mitchell Waite Signature Series) by Mitchell Waite (PDF)

6

 

Ebook Info

  • Published: 1998
  • Number of pages: 617 pages
  • Format: PDF
  • File Size: 3.04 MB
  • Authors: Mitchell Waite

Description

An introduction to the subject of data structure and algorithm programming, typically covered in second year computer science courses. Deemphasizing software engineering, the volume’s 15 chapters cover: arrays, stacks and queues, simple sorting, linked lists, recursion, advanced sorting, binary trees, red-black trees, 2-3-4 trees and external storage, hash tables, heaps, and weighted graphs. The CD-ROM contains visual simulations of algorithm examples from the book. Annotation c. by Book News, Inc., Portland, Or.

User’s Reviews

Editorial Reviews: Amazon.com Review While most books on algorithms and data structures use C or C++ for their examples, Data Structures and Algorithms in Java introduces data structures, sorting, and related algorithms using the Java programming language. This worthy reference helps working programmers get the most out of using Java to store and manipulate data efficiently.The book starts out with simple data structures, such as Java arrays, and looks at a variety of traditional sorting algorithms, such as the quick sort and the bubble sort. Along the way, the author uses clear-cut examples in Java that show the ordering of elements visually in applets. (All source code is included in the accompanying CD-ROM.) The book then looks at linked lists (which can be efficient in Java because references point to objects in memory the way C++ pointers do).The chapters on working with trees are especially clear. The author introduces and explains all the mathematical concepts needed to understand working with data structures. For example, he explains logarithms from the beginning so the reader will understand how various algorithms will perform with different numbers of elements. The author also includes advanced data structures, such as graphs and weighted graphs, along with sample applets that actually demonstrate what these containers look like and how they store and retrieve data.The book concludes with a discussion of when to choose particular data structures over others–a topic that is less critical as CPU speed increases. In all, Data Structures and Algorithms in Java is a concise and readable excursion into the world of data structures. The book does an admirable job of showing how a traditional topic in computer science is handled in one of today’s most popular programming languages. –Richard V. Dragan From the Back Cover Not filled with with obtuse mathematics and difficult proofs, MWSS:Data Structures and Algorithms in Java removes the mystique from DS&A. It does this in two ways. First, the text is written in a straightforward style, making it accessible to anyone. Second, unique new Java demonstration programs, called “Workshop Applets,” are provided with the book. These Workshop Applets provide interactive “moving pictures” which the user can control and modify by pressing buttons. The book’s text describes specific operations the user can carry out with these Workshop Applets, and the applets then reveal the inner workings of an algorithm or data structure.

Reviews from Amazon users which were colected at the time this book was published on the website:

⭐I give this book 5 stars. 1. It has a great Table of Contents and Index. Finding topics is a breeze. 2. The explanations for the various data structures presented were outstanding. Explanations were built using simple words and short sentences which facilitates grasping new concepts and definitions. When new words were introduced, their meanings were thoroughly and simply explained. It is a good read. 3. Every data structure and its mechanisms were represented by drawings of colored objects that represented the various data structures. It made visualization of abstract concepts a breeze. This book has the best pictorial representations of Data Structures I that I have seen. (I reviewed over 14 textbooks. Most were didactic regurgitations of either Knuth’s tome or Weiss, i.e., difficult to read, appear written for an audience of academics, not students.) 4.The book is very well made. I used it every day for 4 months and it showed no signs of wear and tear. Several other books had pages falling off of their backing withing two weeks of purchase. I returned those books. This book will be will me for decades. 5. The CD included with the book is quite good, and the price of this book was far better than other books. It is an excellent value. Why did I need a book about Data Structures? One required course that I took for my CSCI degree was Data Structures. The book chosen by the CSCI department for our course in Data Structures was “Data Structures & Algorithm Analysis in Java ” by Mark Allen Weiss. I reviewed it in detail and found that it was not written in a easy to understand format. Also, it did not include enough diagrams to help me grasp abstract concepts. After reviewing this book, “Data Structures And Algorithms in Java” I purchased it and used it exclusively. It was essential to helping me grasp the concepts of how B-Trees and other structures operate and when they are indicated for use. This book is one of the reasons I got an “A”.

⭐I am so happy to tell that I can read and understand most of complex data structures and algorithm concepts from this book.The book author explain all complex things very simply by using real world examples,I have no words to say,only I have to tell you is “This book is Awesome”.Quality of the book is very good,This is the first time I’m reading a big book which has 500-600 pages,believe me the book is like a very much interesting story for me.

⭐I am a great fan of Robert Lafore’s books. I purchased this book as soon as I came to know about it. I read the book with maximum expectations and never felt disappointed by it. Students who feel intimidated by DSA concepts should definitely read this book. A great book from a great author.

⭐great product. i have no complaints. the book was in good condition as promised and i received it on time. thanks again.

⭐I bought this book a couple of years ago as a reference for a data structures class I was taking. While the teacher used another book (based on C++) for teaching his class, it was MUCH easier to understand these subject with this book. The different structures and algorithms are clearly presented and implemented and the workshop applet included are crucial for understanding visually these algorithms and structures. Still, it lacks examples that truly take power of different features that Java has that makes creating these structures easier. For example, the stack data structure is explained using an integer array, which is fine for structures with an specific size, but lack the expandabilty that features like inheritance, encapsulation and polymorphism can offer. If instead of using an integer array, a class with a generic Object (which is the superclass of all the classes in Java) class was used, all the examples in this book would be prepared for real world situations, instead of readiness for an specific data type and/or size. Nevertheless, I still recomend this book to everyone that wants to learn data structures easily with little pain, but lots of gain.

⭐When I started studying data structures, I was quite taken aback by the descriptions given in my college textbook. The examples were convoluted and shied from giving the reader an understanding of the basic concepts. Rather, it chose to focus purely on algorithmic analysis. That approach required too many mathematical proofs and other complex notation. Fortunately for me, this gem by Lafore came to the rescue.Lafore’s illustration of data structures is concise and easy to follow. In each section the data structure is discussed in general and then further dissected into easily understandable subsections. An added benefit is that each chapter has Java code that illustrates the main functions of each data structure discussed. The code is included on a CD that also contains interactive Java Applets. I found that the applets really helped illustrate how some of the more complex structures work.There is no code in the chapter on Red-Black trees or in the chapter on 2-3-4 Trees and external storage. This is okay however, since presentation of the code might have consumed too much space and have been difficult to follow (Fortunately, There are insightful applets for these topics). My only regret is that the book doesn’t give as much in-depth information on certain functions of B-trees and B+ Trees as it does on the other topics. More than less likely this is a little (too?) picky on my part.Overall a great book to get if you are interested in learning essential Data Structures.

Keywords

Free Download Data Structures & Algorithms in Java (Mitchell Waite Signature Series) in PDF format
Data Structures & Algorithms in Java (Mitchell Waite Signature Series) PDF Free Download
Download Data Structures & Algorithms in Java (Mitchell Waite Signature Series) 1998 PDF Free
Data Structures & Algorithms in Java (Mitchell Waite Signature Series) 1998 PDF Free Download
Download Data Structures & Algorithms in Java (Mitchell Waite Signature Series) PDF
Free Download Ebook Data Structures & Algorithms in Java (Mitchell Waite Signature Series)

Previous articleData Abstraction & Problem Solving with C++: Walls and Mirrors 7th Edition by Frank Carrano (PDF)
Next articleData Structures and Algorithms in C++, Second Edition 2nd Edition by Adam Drozdek (PDF)