Home > Store

Data Abstraction & Problem Solving with C++: Walls and Mirrors (POD File), 7th Edition

Data Abstraction & Problem Solving with C++: Walls and Mirrors (POD File), 7th Edition

eBook (Adobe DRM)

  • Your Price: $49.99
  • About Adobe DRM eBooks
  • This eBook requires the free Adobe® Digital Editions software.

    Before downloading this DRM-encrypted PDF, be sure to:


    • Install the free Adobe Digital Editions software on your machine. Adobe Digital Editions only works on Macintosh and Windows, and requires the Adobe Flash Player. Please see the official system requirements.
    • Authorize your copy of Adobe Digital Editions using your Adobe ID (select AdobeID as the eBook vendor). If you don't already have an Adobe ID, you can create one here.
Not for Sale

Also available in other formats.

Register your product to gain access to bonus material or receive a coupon.

Description

  • Copyright 2017
  • Edition: 7th
  • eBook (Adobe DRM)
  • ISBN-10: 0-13-530623-X
  • ISBN-13: 978-0-13-530623-9

This is the eBook of the printed book and may not include any media, website access codes, or print supplements that may come packaged with the bound book.

For courses in C++ Data Structures

Concepts of Data Abstraction and Manipulation for C++ Programmers

The Seventh Edition of Data Abstraction & Problem Solving with C++: Walls and Mirrors introduces fundamental computer science concepts related to the study of data structures. The text Explores problem solving and the efficient access and manipulation of data and is intended for readers who already have a basic understanding of C++.

The “walls and mirrors” mentioned in the title represent problem-solving techniques that appear throughout the text. Data abstraction hides the details of a module from the rest of the program, whereas recursion is a repetitive technique that solves a problem by solving smaller versions of the same problems, much as images in facing mirrors grow smaller with each reflection. Along with general changes to improve clarity and correctness, this Seventh Edition includes new notes, programming tips, and sample problems.

Sample Content

Table of Contents

1. Data Abstraction: The Walls

2. Recursion: The Mirrors

3. Array-Based Implementations

4. Link-Based Implementations

5. Recursion as a Problem-Solving Technique

6. Stacks

7. Stack Implementations

8. Lists

9. List Implementations

10. Algorithm Efficiency

11. Sorting Algorithms and Their Efficiency

12. Sorted Lists and Their Implementations

13. Queues and Priority Queues

14. Queue Implementations

15. Trees

16. Tree Implementations

17. Heaps

18. Dictionaries and Their Implementations

19. Balanced Search Trees

20. Graphs

21. Processing Data in External Storage

Updates

Submit Errata

More Information

Unlimited one-month access with your purchase
Free Safari Membership