• Problem Solving and Software Engineering
• Achieving a Modular Design
• A Summary of Key Issues in Programming

• Recursive Solutions
• Counting Things
• Searching an Array
• Organizing Data
• Recursion and Efficiency

• Abstract Data Types
• Specifying ADTs
• Implementing ADTs

• Preliminaries
• Programming with Linked Lists
• Variations of the Linked List
• Application: Maintaining an Inventory
• The C++Standard Template Library

• Backtracking
• Defining Languages
• The Relationship Between Recursion and Mathematical Induction

PART II. PROBLEM SOLVING WITH ABSTRACT DATA TYPES

• 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

• The Abstract Data Type Queue
• Simple Applications of the ADT Queue
• Implementations of the ADT Queue
• Application: Simulation
• A Summary of Position-Oriented ADTs
• Class Relationships

• Inheritance Revisited
• Virtual Functions and Late Binding
• Friends
• The ADTs List and Sorted List Revisited
• Class Templates
• Overloaded Operators
• Iterators

• Terminology
• The ADT Binary Tree
• The ADT Binary Search Tree
• General Trees

• The ADT Table
• The ADT Priority Queue: A Variation of the ADT Table

• Balanced Search Trees
• Hashing
• Data with Multiple Organizations

• Terminology
• Graphs as ADTs
• Graph Traversals
• Applications of Graphs

• A Look at External Storage
• Sorting Data in an External File
• External Tables

• Language Basics
• Input and Output Using iostream
• Functions
• Selection Statements
• Iteration Statements
• Arrays
• Strings
• Structures
• C++Exceptions
• File Input and Output
• Libraries
• A Comparison to Java

Appendix B. Ascii Character Codes

Appendix C. C++ Header Files And Standard Functions

Appendix D. Mathematical Induction

Appendix E. Standard Template Library Classes