Data Abstraction and Problem Solving with C++

ISBN-10: 0321247256

ISBN-13: 9780321247254

Edition: 4th 2005 (Revised)

List price: $117.60
30 day, 100% satisfaction guarantee

If an item you ordered from TextbookRush does not meet your expectations due to an error on our part, simply fill out a return request and then return it by mail within 30 days of ordering it for a full refund of item cost.

Learn more about our returns policy

Description:

what's this?
Rush Rewards U
Members Receive:
coins
coins
You have reached 400 XP and carrot coins. That is the daily max!

Study Briefs

Limited time offer: Get the first one free! (?)

All the information you need in one place! Each Study Brief is a summary of one specific subject; facts, figures, and explanations to help you learn faster.

Add to cart
Study Briefs
SQL Online content $4.95 $1.99
Add to cart
Study Briefs
MS Excel® 2010 Online content $4.95 $1.99
Add to cart
Study Briefs
MS Word® 2010 Online content $4.95 $1.99
Add to cart
Study Briefs
MS PowerPoint® 2010 Online content $4.95 $1.99

Customers also bought

Loading
Loading
Loading
Loading
Loading
Loading
Loading
Loading
Loading
Loading

Book details

List price: $117.60
Edition: 4th
Copyright year: 2005
Publisher: Addison-Wesley Longman, Incorporated
Publication date: 4/2/2004
Binding: Hardcover
Pages: 992
Size: 8.25" wide x 10.00" long x 1.50" tall
Weight: 4.136
Language: English

Preface
Chapter Dependency Chart
Problem-Solving Techniques
Principles of Programming and Software Engineering
Problem Solving and Software Engineering
Achieving A Modular Design
A Summary of Key Issues in Programming
Recursion: The Mirrors
Recursive Solutions
Counting Things
Searching An Array
Organizing Data
Recursion And Efficiency
Data Abstraction: The Walls
Abstract Data Types
Specifying ADTs
Implementing ADTs
Linked Lists
Preliminaries
Programming with Linked Lists
Variations of the Linked List 206
Application: Maintaining an Inventory
The C++ Standard Template Library
Recursion as a Problem-Solving Technique
Backtracking
Defining Languages
The Relationship between Recursion and Mathematical Induction
Problem Solving with Abstract Data Types
Stacks
The Abstract Data Type Stack
Simple Applications Of The ADT Stack
Implementations Of The ADT Stack
Application: Algebraic Expressions
Application: A Search Problem
The Relationship between Stacks and Recursion
Queues
The Abstract Data Type Queue
Simple Applications of the ADT Queue
Implementations of the ADT Queue
A Summary Of Position-Oriented ADTs
Application: Simulation
Advanced C++ Topics
Inheritance Revisited
Virtual Functions and Late Binding
Friends
The ADTs List and Sorted List Revisited
Class Templates
Overloaded Operators
Iterators
Algorithm Efficiency and Sorting
Measuring the Efficiency of Algorithms
Sorting Algorithms and Their Efficiency
Trees
Terminology
The ADT Binary Tree
The ADT Bin
×
Free shipping on orders over $35*

*A minimum purchase of $35 is required. Shipping is provided via FedEx SmartPost® and FedEx Express Saver®. Average delivery time is 1 – 5 business days, but is not guaranteed in that timeframe. Also allow 1 - 2 days for processing. Free shipping is eligible only in the continental United States and excludes Hawaii, Alaska and Puerto Rico. FedEx service marks used by permission."Marketplace" orders are not eligible for free or discounted shipping.

Learn more about the TextbookRush Marketplace.

×