- STAFF PICKS
- GIFTS + GIFT CARDS
- SELL BOOKS
- FIND A STORE
Ships in 1 to 3 days
available for shipping or prepaid pickup only
Available for In-store Pickup
in 7 to 12 days
Data Structures and Program Design Using C (2ND 97 Edition)by Robert L. Kruse
Synopses & ReviewsPlease note that used books may not include additional media (study guides, CDs, DVDs, solutions manuals, etc.) as described in the publisher comments.
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. 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.
Book News Annotation:
An introduction to data structures using the C programming language and emphasizing problem specification, program design, and program correctness. Learning aids include exercises, programming projects, review questions, and pointers and pitfalls. Assumes a first course in programming and basic familiarity with C. This second edition contains programs revised to emphasize data abstraction and reusable code, treats recursion earlier, and covers modern topics such as splay trees and amortized algorithm analysis.
Annotation c. Book News, Inc., Portland, OR (booknews.com)
Appropriate for Computer Science II and Data Structures in departments of 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.
Table of Contents
1. Programming Principles.
2. Introduction to Software Engineering.
3. Stacks and Recursion.
4. Queues and Linked Lists.
5. General Lists.
8. Tables and Information Retrieval.
9. Binary Trees.
10. Multiway Trees.
12. Case Study: The Polish Notation.
Appendix A. Mathematical Methods.
Appendix B. Removal of Recursion.
Appendix C. An Introduction to C.
What Our Readers Are Saying
Other books you might like
Computers and Internet » Computer Languages » C