[Book Cover]

Data Structures and Program Design, 3/e

Robert L. Kruse, St. Mary's University

Published January, 1994 by Prentice Hall Engineering/Science/Mathematics

Copyright 1994, 689 pp.
Cloth
ISBN 0-13-208182-2


Sign up for future
mailings on this subject.

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

    Data Structures-Computer Science


Download


Summary

This volume explores top-down structured problem solving, the process of data abstraction and structuring, and the comparative study of algorithms as fundamental tools of program design.

Features


uses a concrete and practical approach — beginning with simple motivating examples and progressing to general principles.
helps students translate abstract ideas into practice:

  • takes special care in the formulation of ideas into algorithms and in the refinement of algorithms into concrete programs that can be applied to practical problems
  • covers the process of data specification and abstraction before the selection of data structures and their implementations
contains many sample programs worked out in detail — both short procedures and complete programs of substantial length — to show how all tools are used together to build complete programs of realistic size.
  • rewrites programs to make more use of reusable code, packages for various tasks, and data abstraction
  • uses Turbo Pascal, with strong use of units, as the programming-language dialect throughout — with explanations where needed on how to convert to standard Pascal
  • includes pre- and post-conditions for all programs and subprograms
  • develops several additional large sample programs in the text — e.g., parser for Pascal statements, simple text editor, radix sort
includes large programming projects partially developed in the text.
contains sections of Pointers and Pitfalls and marginal notes throughout.
oOffers a thorough treatment of recursion — including a range of its applications, and criteria to determine when recursion is appropriate and when it should be avoided.
  • covers recursion much earlier (Ch. 3)
contains new material on various kinds of search trees.
simplifies treatment of lists.  SOFTWARE INFORMATION: 
(PC DOS format) with source code for all the programs and program segments in the text, and executable programs that will demonstrate almost all of the data structures and algorithms presented.
software is available, free of charge, or as a separate item...


Table of Contents
    1. Programming Principles.
    2. Introduction to Software Engineering.
    3. Stacks and Recursion.
    4. Examples of Recursion.
    5. Queues.
    6. Lists.
    7. Searching.
    8. Sorting.
    9. Tables and Information Retrieval.
    10. Binary Trees.
    11. Multiway Trees.
    12. Graphs.
    13. Case Study: The Polish Notation.
    Appendix A: Mathematical Methods.
    Appendix B: Random Numbers.
    Appendix C: Units, Include Files, and Utility Procedures.
    Appendix D: Pascal Features.
    Index.

[Help]

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