Data Abstraction & Problem Solving with C++

Name: Data Abstraction & Problem Solving with C++
Brand: Pearson Education (US)
Price: 252.75 AUD
Availability: BackOrder

Walls and Mirrors

By: Frank Carrano, Timothy Henry

Write A Review

Paperback | 14 March 2016 | Edition Number 7

At a Glance

Paperback
864 Pages

Edition Type
Revised

Dimensions(cm)
3 x 20.5 x 25.1

Paperback

RRP $268.95

$252.75

or 4 interest-free payments of $63.19 with

Available for Backorder. We will order this from our supplier however there isn't a current ETA.

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.

Shipping

	Standard Shipping	Express Shipping
Metro postcodes:	$9.99	$14.95
Regional postcodes:	$9.99	$14.95
Rural postcodes:	$9.99	$14.95

How to return your order

At Booktopia, we offer hassle-free returns in accordance with our returns policy. If you wish to return an item, please get in touch with Booktopia Customer Care.

Additional postage charges may be applicable.