[Book Cover]

Practical Introduction to Data Structures and Algorithm Analysis, A (C++ Edition), 1/e

Clifford A. Shaffer, Virginia Polytechnic Institute & State University

Published August, 1996 by Prentice Hall Engineering/Science/Mathematics

Copyright 1997, 494 pp.
Cloth
ISBN 0-13-190752-2


Sign up for future
mailings on this subject.

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

    Data Structures-Computer Science


Download


Summary

A practical text designed for the needs of undergraduate students.

Features


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.
Gives clear explanations and illustrations for most of the fundamental data structures and algorithms in the text. Figures and/or case examples are provided for nearly all algorithms.
Uses actual C++ code for nearly all algorithms.
Written for users of C++ with the worst of C++ syntactical errors avoided. This allows students and instructors interested in using object- oriented design for their work to incorporate material from this book.
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.
Includes exercises as well as many suggestions for projects to provide students with hands-on experience.
Supports the concept that algorithm analysis is practical and helps in the design of real programs by presenting data structure costs and benefits.
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
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. C++ Tutorial for C and Pascal Programmers.
    Bibliography.
    Index.

[Help]

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