Data Structures via C++ : objects by evolution / A. Michael Berman.
Material type: TextPublication details: New York : Oxford University Press, 1997.Description: xxi, 471 p. : ill. ; 24 cmISBN:- 0195108434
- QA76.73.C153 B46 1997
Item type | Current library | Call number | Copy number | Status | Barcode | |
---|---|---|---|---|---|---|
Books | Library First Floor | QA76.73.C153 B46 1997 (Browse shelf(Opens below)) | 1 | Available | 8363 |
Browsing Library shelves, Shelving location: First Floor Close shelf browser (Hides shelf browser)
QA76.73.C153 B347 1994 C++ problem solving and programming / | QA76.73.C153 B347 1994 C++ problem solving and programming / | QA76.73.C153 B347 1994 C++ problem solving and programming / | QA76.73.C153 B46 1997 Data Structures via C++ : objects by evolution / | QA76.73 .C153 B76 2010 C++ for engineers and scientists / | QA76.73 .C153B77 2000 Program Development and Design Using C+++: | QA76.73 .C153B77 2000 Program Development and Design Using C+++: |
Includes bibliographical references (p. 463-464) and index.
1. Software Engineering and Computer Programming; Software Engineering and Computer Science; The Software Life-Cycle; Why C++?; 2. Designing Software: Two Approaches; Why Design?; Top-Down Design; The Object Alternative; Which method is Better, TDD or OOD?; 3. Software Reliability; Riss of Faulty Software; Testing; Applying Program Correctness Techniques; 4. Abstract Data Types, Classes and Objects; Problem: Computing with Time; Describing Data Types; ADT Implementation and Code Reuse; Information Hiding, Encapsulation, and Views; Creating Encapsulated ADT's Using the C++ Class; Using Standard C++ Class Libraries; ADT's, Objects, and Object-Oriented Programming; 5. Efficiency; Selecting Good Algorithms; The Many Faces of Program Efficiency; Algorithms for Searching; Analysis of some Simple Sorting Algorithms; 6. Recursion; Solving Problems with Recursion; Recursive Definitions; Applying Recursion to Sorting and Searching Problems; How is Recursion implemented?; 7. Lists; Problem: A Membership Management Program; The List ADT; Implementing Lists; The Inorder List ADT; Variations on a Linked List; A Dynamic Linear List; The Membership Management Program Revisited; 8. Stacks; Problem: Robot Navigation; The Stack ADT; Implementing the Stack 1: Array; Creating Generic Classes with Templates; Implementing the Stack 2: Dynamic List; Applications of the Stack ADT; The Robot Navigation Problem Solved; 9. Queue; Problem: Computer Network Performance; The Queue ADT; Implementing a Queue 1: Array; Implementing a Queue 2: Dynamic List; Simulation: modelling a computer network; 10. Tables; A Data Structure to Support Retrieval by Key; Implementing a Table; Hash Tables for Fast Retrieval; Using Tables; 11. Trees; Introducing Trees; Building a Binary Tree; Tree Traversal; Binary Search Trees; Reuse Through Inheritance: A Hierarchy of Trees; Performance of Binary Trees; 12. Graphs; Example
This text is designed for a CS2 data structures course using C++ as the base programming language. The author introduces Object-Oriented Programming concepts in the context of traditional data structures and alghorithms, emphasizing encapsulation from the beginning and gradually bringing in generics, inheritance and polymorphism as the book progresses. Real world examples present the material in a way that makes the text accessible to students. All supporting materials, including source code, will be available to the faculty and students via the World Wide Web.
There are no comments on this title.