Data abstraction and problem solving with C++ : walls and mirrors / Frank M. Carron, Janet J. Prichard
Publication details: Boston ; San Francisco ; London : Addison wiley, c2002Edition: 3rd editionDescription: xxi, 768 p. : ill. ; 26 cmISBN:- 0201741199 (alk. paper)
- 22 005.73 CAR
| Item type | Current library | Call number | Copy number | Status | Date due | Barcode |
|---|---|---|---|---|---|---|
Book Open Access
|
Engineering Library | 005.73 CAR 1 (Browse shelf(Opens below)) | 1 | Available | BUML23080288 |
CONTENTS
Part 1 Problem solving techniques
chapter 1 Principles of programming and software engineering
software solving and software engineering
achieving a modular design, etc
chapter 2 Recursion: The mirrors
recursive solutions
counting things, etc
chapter 3 Data abstraction: the walls
abstraction data types
specifying ADTs, etc
chapter 4. Linked lists
preliminaries
programming with linked lists, etc
chapter 5. Recursive as a problem solving technique
backtracking
defining languages, etc
Part II Problem solving with Abstract data Types
chapter 6. Stacks
the abstract data type stack
simple applications of the ADTs stack, etc
chapter 7. Queries
abstract data type queue
simple application of the ADTs queue, etc
chapter 8. Advanced C++ topics
inheritance revisited
virtual functions and late binding, etc
chapter 9. Algorithm Efficiency and sorting
measuring the efficiency of algorithms
sorting algorithms and their efficiency, etc
chapter 10. Trees
terminology
The ADT Binary tree, etc
11. Tables and priority queues
The ADT table
The ADT priority queue: A variation of the ADT table, etc
chapter 12 Advanced implementations of tables
balanced search trees
hashing, etc
chapter 13. Graphs
Terminology
graphs as ADTs, etc
chapter 14. External methods
Language basics
inputs and outputs using iostream, etc
Glossary : p. A92-A110 . _ Index : p. I1 - I.18
There are no comments on this title.