Data Abstraction & Problem Solving with C++: Walls and Mirrors / Edition 7

Data Abstraction & Problem Solving with C++: Walls and Mirrors / Edition 7

ISBN-10:
0134463978
ISBN-13:
9780134463971
Pub. Date:
03/14/2016
Publisher:
Pearson Education
ISBN-10:
0134463978
ISBN-13:
9780134463971
Pub. Date:
03/14/2016
Publisher:
Pearson Education
Data Abstraction & Problem Solving with C++: Walls and Mirrors / Edition 7

Data Abstraction & Problem Solving with C++: Walls and Mirrors / Edition 7

Paperback

$213.32
Current price is , Original price is $213.32. You
$213.32 
  • SHIP THIS ITEM
    This item is available online through Marketplace sellers.
  • PICK UP IN STORE
    Check Availability at Nearby Stores
  • SHIP THIS ITEM

    Temporarily Out of Stock Online

    Please check back later for updated availability.

This item is available online through Marketplace sellers.


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.


Product Details

ISBN-13: 9780134463971
Publisher: Pearson Education
Publication date: 03/14/2016
Edition description: New Edition
Pages: 864
Product dimensions: 8.00(w) x 10.00(h) x 1.13(d)

About the Author

Frank M. Carrano is a professor emeritus of computer science at the University of Rhode Island. He received the Ph.D. degree in computer science from Syracuse University in 1969. His interests include data structures, computer science education, social issues in computing, and numerical computation. Professor Carrano is particularly interested in the design and delivery of undergraduate courses in computer science. He has authored several well-known computer science textbooks for undergraduates.

Frank’s Making it Real blog http://frank-m-carrano.com/blog/ extends his textbooks and lectures to a lively discussion with instructors and students about teaching and learning computer science.

Follow Frank on Twitter: http://twitter.com/Frank_M_Carrano

Find him on Facebook: https://www.facebook.com/makingitreal

For nearly thirty years, Dr. Timothy M. Henry, PMP, has been teaching computer science concepts along with managing information technology projects for the U. S. Coast Guard and IT consulting companies. His professional expertise encompasses many areas of information technology - design, development, implementation, testing and security. Many of the projects managed by Dr. Henry have successfully used cutting edge secure communication and 3D interactive technologies in novel ways. He has over fifteen years experience teaching computer science and is currently a member of the Computer Science and Statistics faculty at the University of Rhode Island.

He earned his M. S. in Computer Science from Old Dominion University while serving as the IT Director at the Coast Guard's Reserve Training Center in Yorktown, VA. He received his Ph.D. in Applied Mathematics from the University of Rhode Island in 2001.

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
From the B&N Reads Blog

Customer Reviews