Exam 3: Pointers and Array-Based Lists

In an array list the time complexity of the remove function is identical to the time complexity of the ____ function.

The statement ____ stores the address of x in p.

Pointer variables must be initialized if you want them to point to something.

The statement ____ declares list to be an array of five integers.

The ampersand, &, is called the ____.

When an integer is added to a pointer variable, the value of the pointer variable is incremented by the integer times the size of the memory to which the pointer is pointing.

The ampersand, &, is a binary operator that returns the address of its operand.

The length of a list is the number of elements in the list.

You can initialize a pointer variable by setting it to ____.

In a deep copy, two or more pointers have their own data.

To determine whether the item to be inserted is already in the list, the insert function calls the _____ member function.

The * is commonly referred to as the ____ operator.

When a dynamic variable is no longer needed, it can be ____.

When * is used as a unary operator, * refers to the object to which the operand of the * (that is, the pointer) points.

Variables that are created during program execution are called ____ variables.

An array created during the execution of a program is called a dynamic array.

The operator new has two forms: one to allocate a single variable, and another to allocate an array of variables.

The syntax for accessing a class (struct) member using the operator -> is ____.

In the line of code int* p,q, p and q are both pointer variables of type int.

The correct syntax for the destructor of the class tempClass is ____.