C++ Programming. Program Design including Data Structures

Brief Contents
Table of Contents
Preface
Features of the Book
Supplemental Resources
Acknowledgments
Ch 1: An Overview of Computers and Programming Languages
	Introduction
	A Brief Overview of the History of Computers
	Elements of a Computer System
	The Language of a Computer
	The Evolution of Programming Languages
	Processing a C++ Program
	Programming with the Problem Analysis-Coding-Execution Cycle
	Programming Methodologies
	ANSI/ISO Standard C++
	Quick Review
	Exercises
Ch 2: Basic Elements of C++
	A Quick Look at a C++ Program
	The Basics of a C++ Program
	Data Types
	Data Types, Variables, and Assignment Statements
	Arithmetic Operators, Operator Precedence, and Expressions
	Type Conversion (Casting)
	string Type
	Variables, Assignment Statements, and Input Statements
	Increment and Decrement Operators
	Output
	Preprocessor Directives
	Creating a C++ Program
	Debugging: Understanding and Fixing Syntax Errors
	Program Style and Form
	More on Assignment Statements
	Quick Review
	Exercises
	Programming Exercises
Ch 3: Input/Output
	I/O Streams and Standard I/O Devices
	Using Predefined Functions in a Program
	Input Failure
	Output and Formatting Output
	Additional Output Formatting Tools
	Input/Output and the string Type
	Debugging: Understanding Logic Errors and Debugging with cout Statements
	File Input/Output
	Quick Review
	Exercises
	Programming Exercises
Ch 4: Control Structures I (Selection)
	Control Structures
	Using Pseudocode to Develop, Test, and Debug a Program
	Terminating a Program with the assert Function
	Quick Review
	Exercises
	Programming Exercises
Ch 5: Control Structures II (Repetition)
	Why is Repetition Needed?
	while Looping (Repetition) Structure
	for Looping (Repetition) Structure
	do...while Looping (Repetition) Structure
	break and continue Statements
	Nested Control Structures
	Avoiding Bugs by Avoiding Patches
	Debugging Loops
	Quick Review
	Exercises
	Programming Exercises
Ch 6: User-Defined Functions
	Predefined Functions
	User-Defined Functions
	Value-Returning Functions
	Void Functions
	Value Parameters
	Reference Variables as Parameters
	Value and Reference Parameters and Memory Allocation
	Reference Parameters and Value-Returning Functions
	Scope of an Identifier
	Global Variables, Named Constants, and Side Effects
	Static and Automatic Variables
	Debugging: Using Drivers and Stubs
	Function Overloading: An Introduction
	Functions with Default Parameters
	Quick Review
	Exercises
	Programming Exercises
Ch 7: User-Defined Simple Data Types, Namespaces, and the string Type
	Enumeration Type
	Namespaces
	string Type
	Quick Review
	Exercises
	Programming Exercises
Ch 8: Arrays and Strings
	Arrays
	Searching an Array for a Specific Item
	Auto Declaration and Range-Based For Loops
	C-Strings (Character Arrays)
	Parallel Arrays
	Two- and Multidimensional Arrays
	Quick Review
	Exercises
	Programming Exercises
Ch 9: Records (structs)
	Records (structs)
	Quick Review
	Exercises
	Programming Exercises
Ch 10: Classes and Data Abstraction
	Classes
	Data Abstraction, Classes, and Abstract Data Types
	A struct versus a class
	Information Hiding
	Executable Code
	More Examples of Classes
	Static Members of a Class
	Quick Review
	Exercises
	Programming Exercises
Ch 11: Inheritance and Composition
	Inheritance
	Composition (Aggregation)
	Object-Oriented Design (OOD) and Object-Oriented Programming (OOP)
	Quick Review
	Exercises
	Programming Exercises
Ch 12: Pointers, Classes, Virtual Functions, Abstract Classes and Lists
	Pointer Data Type and Pointer Variables
	Address of Operator (&)
	Dereferencing Operator (*)
	Classes, Structs, and Pointer Variables
	Initializing Pointer Variables
	Dynamic Variables
	Operations on Pointer Variables
	Dynamic Arrays
	Shallow versus Deep Copy and Pointers
	Classes and Pointers: Some Peculiarities
	Inheritance, Pointers, and Virtual Functions
	Abstract Classes and Pure Virtual Functions
	Array-Based Lists
	Unordered Lists
	Ordered Lists
	Address of Operator and Classes
	Quick Review
	Exercises
	Programming Exercises
Ch 13: Overloading and Templates
	Why Operator Overloading is Needed
	Operator Overloading
	Overloading the Array Index (Subscript) Operator ([])
	Function Overloading
	Templates
	Quick Review
	Exercises
	Programming Exercises
Ch 14: Exception Handling
	Handling Exceptions within a Program
	Creating Your Own Exception Classes
	Exception-Handling Techniques
	Stack Unwinding
	Quick Review
	Exercises
	Programming Exercises
Ch 15: Recursion
	Recursive Definitions
	Problem Solving Using Recursion
	Recursion or Iteration?
	Quick Review
	Exercises
	Programming Exercises
Ch 16: Linked Lists
	Linked Lists
	Linked List as an ADT
	Unordered Linked Lists
	Ordered Linked Lists
	Print a Linked List in Reverse Order (Recursion Revisited)
	Doubly Linked Lists
	Circular Linked Lists
	Quick Review
	Exercises
	Programming Exercises
Ch 17: Stacks and Queues
	Stacks
	Implementation of Stacks as Arrays
	Linked Implementation of Stacks
	Application of Stacks: Postfix Expressions Calculator
	Removing Recursion: Nonrecursive Algorithm to Print a Linked List Backward
	Queues
	Application of Queues: Simulation
	Quick Review
	Exercises
	Programming Exercises
Ch 18: Searching and Sorting Algorithms
	Searching and Sorting Algorithms
	Search Algorithms
	Asymptotic Notation: Big-O Notation
	Sorting Algorithms
	Sorting a List: Bubble Sort
	Selection Sort: Array-Based Lists
	Insertion Sort: Array-Based Lists
	Lower Bound on Comparison-Based Sort Algorithms
	Quick Sort: Array-Based Lists
	Merge Sort: Linked List-Based Lists
	Quick Review
	Exercises
	Programming Exercises
Ch 19: Binary Trees
	Binary Trees
	Implementing Binary Trees
	Binary Search Trees
	Nonrecursive Binary Tree Traversal Algorithms
	Binary Tree Traversal Algorithms and Functions as Parameters
	Quick Review
	Exercises
	Programming Exercises
Ch 20: Graphs
	Introduction
	Graph Definitions and Notations
	Graph Representation
	Operations on Graphs
	Graphs as ADTs
	Graph Traversals
	Shortest Path Algorithm
	Minimal Spanning Tree
	Quick Review
	Exercises
	Programming Exercises
Ch 21: Standard Template Library (STL)
	Components of the STL
	Iterators
	Associative Containers
	Container Adapters
	Containers, Associated Header Files, and Iterator Support
	Algorithms
	Quick Review
	Exercises
	Programming Exercises
Appendix A: Reserved Words
Appendix B: Operator Precedence
Appendix C: Character Sets
	ASCII (American Standard Code for Information Interchange)
	EBCDIC (Extended Binary Coded Decimal Interchange Code)
Appendix D: Operator Overloading
Appendix E: Additional C++ Topics
	Binary (Base 2) Representation of a Nonnegative Integer
	More on File Input/Output
	Naming Conventions of Header Files in ANSI/ISO Standard C++ and Standard C++
Appendix F: Header Files
	Header File cassert (assert.h)
	Header File cctype (ctype.h)
	Header File cfloat (float.h)
	Header File climits (limits.h)
	Header File cmath (math.h)
Appendix G: Memory Size on a System and Random Number Generator
	Random Number Generator
Appendix H: References
Appendix I: Answers to Odd-Numbered Exercises
Index