Data Abstraction and Problem Solving With C++ Walls and Mirrors

9780321247254

0321247256

Preface. Chapter Dependency Chart. I. PROBLEM-SOLVING TECHNIQUES. 1. Principles of Programming and Software Engineering. Problem Solving and Software Engineering. Achieving A Modular Design. A Summary of Key Issues in Programming. 2. Recursion: The Mirrors. Recursive Solutions. Counting Things. Searching An Array. Organizing Data. Recursion And Efficiency. 3. Data Abstraction: The Walls. Abstract Data Types. Specifying ADTs. Implementing ADTs. 4. Linked Lists. Preliminaries. Programming with Linked Lists. Variations of the Linked List 206. Application: Maintaining an Inventory. The C++ Standard Template Library. 5. Recursion as a Problem-Solving Technique. Backtracking. Defining Languages. The Relationship between Recursion and Mathematical Induction. II. PROBLEM SOLVING WITH ABSTRACT DATA TYPES. 6. 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. 7. 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. 8. Advanced C++ Topics. Inheritance Revisited. Virtual Functions and Late Binding. Friends. The ADTs List and Sorted List Revisited. Class Templates. Overloaded Operators. Iterators. 9. Algorithm Efficiency and Sorting. Measuring the Efficiency of Algorithms. Sorting Algorithms and Their Efficiency. 10. Trees. Terminology. The ADT Binary Tree. The ADT Bin