Pearson+

Data Abstraction & Problem Solving with C++: Walls and Mirrors, 7th edition

  • Frank M. Carrano
  • , Timothy M. Henry

  • Listen on the go
    Listen on the go

    Learn how you like with full eTextbook audio

  • Find it fast
    Find it fast

    Quickly navigate your eTextbook with search

  • Stay organized
    Stay organized

    Access all your eTextbooks in one place

  • Easily continue access
    Easily continue access

    Keep learning with auto-renew

For courses in C++ Data Structures

 

Concepts of Data Structures and Abstraction 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 students who already have a basic understanding of programming, preferably in 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 features new notes, programming tips, examples, and programming problems, as well as C++11 and C++14 features–including safe memory management using smart pointers–and safe and secure coding techniques.

Published by Pearson (July 14th 2021) - Copyright © 2017

ISBN-13: 9780137516759

Subject: Programming - Intermediate/Advanced

Category: C++ Data Structures

Brief 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