 |
|
|
|
|
Classes and Dynamic Data |
|
|
|
| |
|
|
|
|
|
Class Destructors |
|
|
|
| |
|
|
|
|
|
Shallow Versus Deep Copying |
|
|
|
| |
|
|
|
|
|
Class Copy-Constructors |
|
|
|
| |
|
|
|
|
|
Problem-Solving Case Study: Personnel Records |
|
|
|
| |
|
|
|
|
|
Problem-Solving Case Study: Dynamic Arrays |
|
|
|
| |
|
|
|
|
|
Testing and Debugging |
|
|
|
| |
|
|
|
|
|
Testing and Debugging Hints |
|
|
|
| |
|
|
|
|
|
Summary |
|
|
|
| |
|
|
|
|
|
Quick Check |
|
|
|
| |
|
|
|
|
|
Exam Preparation Exercises |
|
|
|
| |
|
|
|
|
|
Programming Warm-Up Exercises |
|
|
|
| |
|
|
|
|
|
Programming Problems |
|
|
|
| |
|
|
|
|
|
Case Study Follow-Up |
|
|
|
| |
| |
|
|
|
|
|
Sequential Versus Linked Structures |
|
|
|
| |
|
|
|
|
|
Array Representation of a Linked List |
|
|
|
| |
|
|
|
|
|
Dynamic Data Representation of a Linked List |
|
|
|
| |
|
|
|
|
|
Algorithms on Dynamic Linked Lists |
|
|
|
| |
|
|
|
|
|
Creating an Empty Linked List |
|
|
|
| |
|
|
|
|
|
Testing for an Empty Linked List |
|
|
|
| |
|
|
|
|
|
Printing a Linked List |
|
|
|
| |
|
|
|
|
|
Inserting into a Linked List |
|
|
|
| |
|
|
|
|
|
Deleting from a Linked List |
|
|
|
| |
|
|
|
|
|
Pointer Expressions |
|
|
|
| |
|
|
|
|
|
Classes and Dynamic Linked Lists |
|
|
|
| |
|
|
|
|
|
Choice of Data Representation |
|
|
|
| |
|
|
|
|
|
Problem-Solving Case Study: Simulated Playing Cards |
|
|
|
| |
|
|
|
|
|
Problem-Solving Case Study: Solitaire Simulation |
|
|
|
| |
|
|
|
|
|
Testing and Debugging |
|
|
|
| |
|
|
|
|
|
Testing and Debugging Hints |
|
|
|
| |
|
|
|
|
|
Summary |
|
|
|
| |
|
|
|
|
|
Quick Check |
|
|
|
| |
|
|
|
|
|
Exam Preparation Exercises |
|
|
|
| |
|
|
|
|
|
Programming Warm-Up Exercises |
|
|
|
| |
|
|
|
|
|
Programming Problems |
|
|
|
| |
|
|
|
|
|
Case Study Follow-Up |
|
|
|
| |