Define each of the key terms listed in the chart below.

State the two principle uses of pointers in OOT (11.1).

Explain the difference between storing records using pointers and storing records using arrays (11.1).

Explain what the new and free statements do when using pointers (11.1).

Explain the use of ^ and -> when using pointers (11.1).

Describe the advantages and disadvantages to using pointers (11.1 - 11.2).

When creating a data structure which uses pointers, explain what modifications need to be made in order to have a long list of records (11.).

Explain how nil is used in pointers (11.2 - 11.3).

State the definition of the abstract data type List (11.4).

Explain the purpose of each operation found in the abstract data type List (11.4).

Explain how the "list.dem" program supports the operations of the ADT List (11.4).

Discuss the role of the "list.dem" program compared to the "listcl.tu" program for the list class (11.5).

Provide a general explanation of how each of the procedures work in the "listcl.tu" file (11.5).

Describe the difference between the enter procedure in the "listcl.tu" file and the enter procedure in the "sortlicl.tu" file (11.5 & 11.6).

Explain how an uninitialized pointer and a dangling pointer can cause problems, and how these problems might be avoided (11.7).

Declare a pointer using a ^ or pointer to (11.1).

Draw diagrams showing how pointers are moved and re-assigned (11.).

Using pointers, show a method that can be used to input names in one order, and output these names in their reverse order (11.3).

Use a number of pointers (such as last and p) in order to maintain a linked list (11.3).

Show how to add new records into a singly linked list by one of the following methods (11.3):