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

Waite, Mitchell,Lafore, Robert

ISBN 10: 1571690956 / ISBN 13: 9781571690951

Published by Waite Group Pr, 1998

About this Item

Connecting readers with great books since 1972! Used books may not include companion materials, and may have some shelf wear or limited writing. We ship orders daily and Customer Service is our top priority! Seller Inventory # S_428358378

Bibliographic Details

Title: Data Structures & Algorithms in Java (...

Publisher: Waite Group Pr

Publication Date: 1998

Binding: hardcover

Condition: Very Good

About this title

Synopsis:

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.

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