[Book Cover]

Practical Introduction to Data Structures and Algorithms, Java Edition, 1/e

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


Sign up for future
mailings on this subject.

See other books about:
    Java--Data Structures/CS2-Computer Science

    Data Structures-Computer Science


Download


Summary

A practical text designed for the needs of undergraduate students.

Features


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 text and analysis techniques throughout. The techniques provided assume a range of instructional levels so that they may be used by students with varying backgrounds in the subject.
Provides integrated treatment of both in-memory and disk- based algorithm techniques to allow students to see how these techniques are related, and the key differences between them.
Supports the concept that algorithm analysis is practical and helps in the design of real programs by presenting data structure costs and benefits.
Includes exercises as well as many suggestions for projects to provide students with hands-on experience.
Presents several new data structures, including skip lists, multidimensional search trees, and amortized analysis are discussed.
Provides a chapter on the limits of computation: a brief introduction to computability and NP-completeness to permit an easy-to-understand introduction to these topics.


Table of Contents

    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.

[Help]

© Prentice-Hall, Inc. A Simon & Schuster Company
Comments To webmaster@prenhall.com