Data abstraction and problem solving with C++ : walls and mirrors / Frank M. Carrano, Paul Helman, Robert Veroff.
Publication details: Reading, Mass. : Addison-Wesley, c1998.Edition: 2nd edDescription: xxi, Various pages.: ill. ; 26 cmISBN:- 0201874024
- 9780201874020
- 005.133 22 CAR
- 005.133
| Item type | Current library | Call number | Copy number | Status | Date due | Barcode |
|---|---|---|---|---|---|---|
Book Open Access
|
Engineering Library | 005.133 CAR (Browse shelf(Opens below)) | 1 | Available | BUML23100924 |
Table of Content
Chapter 1 Principles pf programming and software engineering
What problem solving and software engineering
Achieving a Modular design
A Summary of key issues in programming
Summary
Chapter 2 Recursion: the mirrors.
Recursion solutions
Counting things
Organizing a parade
Searching an array
etc
Chapter 3 Data abstraction: the walls
Abstract data types.
Specifying ADTs
Implementing ADTs
Programming Problems
Chapter 4 Linked lists
Preliminaries
Pointers
Dynamic allocation of arrays
Programming with linked lists
Variations of the linked lists
etc.
Chapter 5 Recursion as a problem-solving technique
Backtracking
The eight queens problem
Defining languages
Relationships between recursion and mathematical induction
etc.
Part II Problem solving with abstract data types
Chapter 6 Stacks
The abstract data type stack
Developing an ADT during the design of a solution
Simple application of the ADT stack
Implementation of ADT stacks
etc.
Chapter 7 queues
The abstract data types queue
Simple applications of the ADT queue
Reading a string of characters
Implementation of the ADT Queues
etc
Chapter 8 Class relationships
Inheritance
Public, private, and protected inheritance
Is-a, Has-a and as-a relationships
Virtual function and late binding
The ADTS lists and sorted list revisited
Class templates
Overloaded operators
etc.
Chapter 9 Algorithm efficiency and sorting
Measuring the efficiency of algorithms
The execution of time of algorithms
Algorithm growth rates.
Sorting Algorithms and their efficiency
etc.
Chapter 10 trees
Terminology
The ADT binary
Traversals of a binary tree.
The ADT Binary search tree
etc.
Chapter 11 Tables and priority queens
The ADT table.
Selecting an implementation
A sorted array-based implementation of the ADT table.
The ADT Priority Queue: A variation of the ADT Table
etc.
Chapter 12 Advanced Implementation of tables
Balanced search
Hashing
Hash functions.
Data with multiple Organisation
Chapter 13 Graphs
Terminology
Graphs as ADTs
Implementations
Graph transversal
etc.
Chapter 14 External methods
A look at External storage
Sorting data in an external file
External hashing
Includes indexes : p. : A113 - 1-11
There are no comments on this title.