- Series: Mitchell Waite Signature Series
- Hardcover: 617 pages
- Publisher: Waite Group Pr (March 1, 1998)
- Language: English
- ISBN-10: 1571690956
- ISBN-13: 978-1571690951
- Product Dimensions: 8.5 x 1.5 x 9.8 inches
- Shipping Weight: 3.2 pounds (View shipping rates and policies)
- Average Customer Review: 20 customer reviews
- Amazon Best Sellers Rank: #1,428,724 in Books (See Top 100 in Books)
Enter your mobile number or email address below and we'll send you a link to download the free Kindle App. Then you can start reading Kindle books on your smartphone, tablet, or computer - no Kindle device required.
To get the free app, enter your mobile phone number.
Data Structures & Algorithms in Java (Mitchell Waite Signature Series)
Use the Amazon App to scan ISBNs and compare prices.
Fulfillment by Amazon (FBA) is a service we offer sellers that lets them store their products in Amazon's fulfillment centers, and we directly pack, ship, and provide customer service for these products. Something we hope you'll especially enjoy: FBA items qualify for FREE Shipping and Amazon Prime.
If you're a seller, Fulfillment by Amazon can help you increase your sales. We invite you to learn more about Fulfillment by Amazon .
There is a newer edition of this item:
Customers who viewed this item also viewed
Customers who bought this item also bought
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.
Top customer reviews
There was a problem filtering reviews right now. Please try again later.
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.
As mentioned in a previous review, trees are not covered well in this book, but most introductory books don't cover them well either. I don't expect to see an analysis of AVL or red-black trees in an introductory book (Cormen's text, which is the standard for grad school, doesn't explain trees well either). In fact, only Schaffer's book does a creditable job of explaining AVL trees but the implementation of the code isn't the greatest. But for linked lists, stacks,queues, and the like, there are few books that are the equal of this one. Buy the book and you'll pass your DS&A class with flying colors!
This book focuses on data structures, so you won't find much information on String searching, pattern matching, parsing, file compression, or mathematical-type algorithims (random number generators,hashing (some simple hashing is presented), etc). It would be great if these other topics were found in another volume.
The great thing about this book is that it focuses on how the datastructures are implemented without getting bogged down on the "mathematics" behind the performance or other characteristics. If you have read any book by Sedgewick or Knuth you know what what I am talking about (note that those books are also great but focus on a different audience).
The only thing that would make this book better would be if it had exercises and solutions for students to implement.