
Data Abstraction and Problem Solving with C++
Pearson (Publisher)
2nd Edition
Published on 26. January 1998
Book
Hardback
800 pages
978-0-201-87402-0 (ISBN)
Article exhausted; check for reprint
Description
Focusing on data abstraction and data structures, the second edition of this very successful books continues to emphasize the needs of both the instructor and the student. The book illustrates the role of classes and abstract data types (ADTs) in the problem-solving process as the foundation for an object-oriented approach. Throughout the text, the distinction between specification and implementation is continually stressed. The text covers major applications of ADTs, such as searching a flight map and performing an event-driven simulation. It also offers early, extensive coverage of recursion and uses this technique in many examples and exercises. Overall, the lucid writing style, widespread use of examples, and flexible coverage of the materia have helped make this a leading book in the field. New in this Edition *Uses recent enhancements to C++, such as data type bool and C++ strings *States ADT operations in English, specifies them in pseudocode, and finally implements them in C++. Students can see more clearly the progression from an informal statement of an operation to a more formal specification.*
Offers new and revised examples of ADTs that clarify their relationships to classes as well as new coverage of dynamically allocated arrays and circuits *Provides more balance between numeric and nonnumeric examples of recursion *Contains many new exercises and programming problems ** Instructor's materials are available from your sales rep. If you do not know your local sales representative, please call 1-800-552-2499 for assistance, or use the Addison Wesley Longman rep-locator at http://hepg.awl.com/rep-locator. 0201874024B04062001
Offers new and revised examples of ADTs that clarify their relationships to classes as well as new coverage of dynamically allocated arrays and circuits *Provides more balance between numeric and nonnumeric examples of recursion *Contains many new exercises and programming problems ** Instructor's materials are available from your sales rep. If you do not know your local sales representative, please call 1-800-552-2499 for assistance, or use the Addison Wesley Longman rep-locator at http://hepg.awl.com/rep-locator. 0201874024B04062001
More details
Edition
2nd edition
Language
English
Place of publication
United States
Publishing group
Pearson Education (US)
Target group
College/higher education
Dimensions
Height: 262 mm
Width: 207 mm
Thickness: 35 mm
Weight
1704 gr
ISBN-13
978-0-201-87402-0 (9780201874020)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Classification
Other editions
New editions

Book
10/2001
3rd Edition
Pearson
€63.13
Article exhausted; check for reprint
Persons
Frank M. Carrano is Associate Professor of Computer Science at the University of Rhode Island.
0201874024AB04062001
0201874024AB04062001
Content
Part I: PROBLEM SOLVING TECHNIQUES 1. Principles of Programming 2. Recursion: the Mirrors 3. Data Abstraction: The Walls 4. Linked Lists 5. Recursion as a Problem-Solving Technique Part II: PROBLEM SOLVING WITH ABSTRACT DATA TYPES 6. Stacks 7. Queues 8. Class Relationships 9. Trees 10. Tables and Priority Queues 11. Advanced Implementations of Tables 12. Graphs 13. External Methods Appendix A: Review of C++ Fundamentals Appendix B: ASCII Character Codes Appendix C: C++ Header Files and Standard Functions Appendix D: Mathematical Induction Glossary