Data Structures and Program Design In C - 2nd edition

Customers who bought this, also bought: Macromedia Dreamweaver 8 with ASP, ColdFusion, and PHP : Training from the Source (Paperback) The Java Way: An introduction to Programming in Java, 2e Database Systems, 4th Edition Apple Confidential 2.0: The Definitive History of the World's Most Colorful Company Introduction to Algorithms - 2nd Edition

by: Kruse, Robert L. ; Leung, Bruce P. ; Tondo, Clovis L.

On-line Price: $85.95 (includes GST) Hardcover package 671 30%Off Retail Price You save: $37.00 Sale Item - Special discount -limited stock _____________________ N.Sydney : In Stock Supplier : In Transit	Retail Price: $122.95 Publisher: PRENTICE HALL,17th July 1996 Category: C++ PROGRAMMING Level: B/I/A ISBN: 013288366X ISBN13: 9780132883665
Add to Shopping Cart

Progressing from the concrete to the abstract -- and using numerous, substantial case studies and sample programs -- this book explores structured problem solving, data abstraction, software engineering principles, and the comparative analysis of algorithms as fundamental tools of program design. KEY TOPICS: Emphasizes principles of top-down refinement, program design, review, and testing. Uses the C programming language throughout. Offers Internet access to the source code for all the programs and program extracts printed in the book.

  Features

      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.

Table of Contents

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.