Data Structures and Program Design In C
United States Edition
2nd Edition
Published on 9. October 1996
Book
Hardback
671 pages
978-0-13-288366-5 (ISBN)
Description
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.
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.
More details
Edition
2nd edition
Language
English
Place of publication
United States
Publishing group
Pearson Education (US)
Target group
College/higher education
Dimensions
Height: 196 mm
Width: 242 mm
Thickness: 30 mm
Weight
1188 gr
ISBN-13
978-0-13-288366-5 (9780132883665)
Copyright in bibliographic data is held by Nielsen Book Services Limited or its licensors: all rights reserved.
Schweitzer Classification
Other editions
Previous edition
Robert L. Kruse | Bruce P. Leung | Clovis L. Tondo
Data Structures and Program Design in C
Book
01/1991
Pearson
€34.61
Article exhausted; check for reprint
Content
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.
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.