Clifford A. Shaffer, Virginia Polytechnic Institute & State University

Published December, 1997 by Prentice Hall Engineering/Science/Mathematics

Copyright 1998, 488 pp.
Cloth
ISBN 0-13-660911-2
$63.00

Sign up for future
mailings on this subject.

See other books about:
    Data Structures

The author, Cliff Shaffer provides a superior learning tool for those who desire more rigorous data structures and an algorithm analysis book utilizing Java.

While the author covers most of the standard data structures, he concentrates on teaching the principles required to select or design a data structure that will best solve a problem. The emphasis is on data structures, and algorithm analysis, not teaching Java. Java is utilized strictly as a tool to illustrate data structures concepts and only the minimal, useful subset of Java is included.



Provides an understanding of fundamental data structures through clear explanations, illustrations, and case studies.

• Uses actual Java code for nearly all algorithms.

• Presents basic analysis terminology early in the book and analysis techniques throughout. The techniques provided assume a range of instructional levels so that they may be used with varying backgrounds in the subject.

• Provides integrated treatment of both in-memory and disk-based algorithm techniques to allow readers to see how these techniques are related, and the key differences between them.

Preface.

I. PRELIMINARIES.

1. Data Structures and Algorithms.
2. Mathematical Preliminaries.
3. Algorithm Analysis.

II. FUNDAMENTAL DATA STRUCTURES.

4. Lists, Stacks, and Queues.
5. Binary Trees.
6. General Trees.
7. Graphs.

III. SORTING AND SEARCHING.

8. Internal Sorting.
9. File Processing and External Sorting.
10. Searching.
11. Indexing.

IV. APPLICATIONS AND ADVANCED TOPICS.

12. Lists and Arrays Revisited.
13. Advanced Tree Structures.
14. Analysis Techniques.
15. Limits to Computation.

V. APPENDIX.

A. Java Tutorial for C and Pascal Programmers.
Bibliography.
Index.