Robert L. Kruse, St. Mary's University
Bruce P. Leung, Connected Components Corp.
Clovis L. Tondo, T&T TechnWorks, Inc.

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

Copyright 1997, 671 pp.
Cloth
ISBN 0-13-288366-X

Sign up for future
mailings on this subject.

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

    Data Structures-Computer Science

Progressing from the concrete to the abstract — and using numerous, substantial case studies and sample programs — this text explores structured problem solving, data abstraction, software engineering principles, and the comparative analysis of algorithms as fundamental tools of program design.




Stresses recursion through a range of applications and development of criteria for use.
Features numerous case studies that integrate various topics into programs of various size.
Discusses major principles of software engineering and applies them to large programming projects.
Uses the C programming language throughout. Briefly reviews the syntax of C in chapter 1 and provides a brief introduction to the language in an appendix.
Reviews several topics (in appendices) that are often missing from student's preparation:

• mathamatical methods.
• removal of recursion.
• C language features.

Features exercises, programming projects and sample programs (large and small) throughout.
Emphasizes the process of data abstraction and abstract data types (ADTs), separating ADTs from implementation decisions.
NEW—Strengthens the documentation by including informal specification (pre- and postconditions) with all subprograms.
NEW—Treats recursion much earlier and emphasizes it repeatedly throughout.
NEW—Revises all programs to emphasize data abstraction, to develop and employ reusable code, and to strengthen uniformity and elegance of style.
NEW—Adds coverage several more advanced, modern topics, e.g.:

• Splay trees.
• Red-black trees.
• Amortized algorithm analysis.

NEW—Contains new case studies — e.g., a miniature text editor (Ch. 5).
NEW—Contains new exercises and programming projects — including continuing projects on information retrieval that request students to compare the performance of several different data structures and algorithms.
NEW—Offers Internet access to the source code for all the programs and program extracts printed in the text.
NEW—Gathers material on graph theory and graph algorithms into a separate chapter.
NEW—Streamlines the treatment of lists.

1. Programming Principles.
2. Introduction to Software Engineering.
3. Stacks and Recursion.
4. Queues and Linked Lists.
5. General Lists.
6. Searching.
7. Sorting.
8. Tables and Information Retrieval.
9. Binary Trees.
10. Multiway Trees.
11. Graphs.
12. Case Study: The Polish Notation.
Appendix A. Mathematical Methods.
Appendix B. Removal of Recursion.
Appendix C. An Introduction to C.
Index.

---

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