Data Abstraction and Problem Solving with C++: Walls and Mirrors
New in this Edition *Uses recent enhancements to C++, such as data type bool and C++ strings *States ADT operations in English, specifies them in pseudocode, and finally implements them in C++. Students can see more clearly the progression from an informal statement of an operation to a more formal specification. *Offers new and revised examples of ADTs that clarify their relationships to classes as well as new coverage of dynamically allocated arrays and circuits *Provides more balance between numeric and nonnumeric examples of recursion *Contains many new exercises and programming problems * * Instructors materials are available from your sales rep. If you do not know your local sales representative, please call 1-800-552-2499 for assistance, or use the Addison Wesley Longman rep-locator at http: //hepg.awl.com/rep-locator. 0201874024B0406200
What people are saying - Write a review
We haven't found any reviews in the usual places.
51 other sections not shown
Other editions - View all
abstract data type ADT list ADT operations ADT table allocated array array-based implementation B-tree ballClass base class beginning binary search tree binary tree block bool& Success chapter const contains copy constructor cout data item data members data structure derived class destructor disk display efficiency empty endl example execution graph hash function hash table header file heap implementation file index file inorder input integer invariant iterative linked list listClass loop member functions Mergesort modular module Newltem node NULL output pointer-based implementation points position Postcondition postfix Precondition prefix expression priority queue Programming Problem pseudocode ptrType queue Quicksort recursive call recursive function recursive solution requires retrieval right subtree root search key Self-Test Exercise sequence solve sorted list sorting algorithm specify sphereClass statement text file tion traversal tree in Figure TreePtr typedef undirected graph vertex vertices virtual void write WriteBackward with string