Data Abstraction and Problem Solving with C++

Name: Data Abstraction and Problem Solving with C++
Price: 6.74 USD
Availability: InStock
ISBN: 9780321247254

ISBN-10: 0321247256

ISBN-13: 9780321247254

Edition: 4th 2005 (Revised)

Authors: Frank M. Carrano, Janet J. Prichard

List price: $117.60

30 day, 100% satisfaction guarantee!

Marketplace

3 new & used from $6.74

what's this?

Rush Rewards U
Members Receive:

You have reached 400 XP and carrot coins. That is the daily max!

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