9780134463971

Data Abstraction & Problem Solving with C++ Walls and Mirrors

by ;
  • ISBN13:

    9780134463971

  • ISBN10:

    0134463978

  • Edition: 7th
  • Format: Paperback
  • Copyright: 3/14/2016
  • Publisher: Pearson

Note: Supplemental materials are not guaranteed with Rental or Used book purchases.

Purchase Benefits

  • Free Shipping On Orders Over $59!
    Your order must be $59 or more to qualify for free economy shipping. Bulk sales, PO's, Marketplace items, eBooks and apparel do not qualify for this offer.
  • Get Rewarded for Ordering Your Textbooks! Enroll Now
  • We Buy This Book Back!
    In-Store Credit: $65.86
    Check/Direct Deposit: $62.72
List Price: $160.80 Save up to $96.48
  • Rent Book $64.32
    Add to Cart Free Shipping

    TERM
    PRICE
    DUE

Supplemental Materials

What is included with this book?

  • The New copy of this book will include any supplemental materials advertised. Please check the title of the book to determine if it should include any access cards, study guides, lab manuals, CDs, etc.
  • The Rental copy of this book is not guaranteed to include any supplemental materials. Typically, only the book itself is included. This is true even if the title states it includes any access cards, study guides, lab manuals, CDs, etc.

Summary

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

Rewards Program

Write a Review