Skip to main content Skip to main navigation
  1. Home
  2. Computer Science & IT
  3. Intermediate / Advanced Programming
  4. C++ Data Structures
  5. Data Abstraction & Problem Solving with C++: Walls and Mirrors

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

  • Frank M. Carrano
  • Timothy M. Henry
Data Abstraction & Problem Solving with C++: Walls and Mirrors

ISBN-13: 9780134463971

Includes: Paperback

7th edition

Published by Pearson (March 14th 2016) - Copyright © 2017

Free delivery
$173.32 $138.66
Free delivery
$173.32 $138.66

What's included

  • Paperback

    You'll get a bound printed text.

Overview

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.

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

For teachers

All the material you need to teach your courses.

Discover teaching material