Pointer in C++: A pointer is a variable whose value will be another variable’s address. Generally, a pointer variable is declared as follows: type var-name; Here, “type” is the pointer’s base type and “var-name” is the pointer variable name. The asterisk is used to designate a variable as a pointer. The delete operator: The delete operator is used to destruct the object that is created with new by deallocating the memory associated with the object. The syntax of delete operator is as follows: [] delete cast-expression [] delete[] cast-expression In the above statement, the “cast-expression” argument must be a pointer to a block of memory previously allocated for an object created with the new operator. Given code: The following code is used to create a dynamic array. int entry; //Initialise pointer entry = new int[10]; //create a dynamic array

Question

Want to see the full answer?

Answer 1

Question

Chapter 9.2, Problem 11STE

Program Plan Intro

Pointer in C++:

A pointer is a variable whose value will be another variable’s address. Generally, a pointer variable is declared as follows:

type var-name;

Here, “type” is the pointer’s base type and “var-name” is the pointer variable name. The asterisk is used to designate a variable as a pointer.

The delete operator:

The delete operator is used to destruct the object that is created with new by deallocating the memory associated with the object.

The syntax of delete operator is as follows:

[] delete cast-expression

[] delete[] cast-expression

In the above statement, the “cast-expression” argument must be a pointer to a block of memory previously allocated for an object created with the new operator.

Given code:

The following code is used to create a dynamic array.

int entry; //Initialise pointer

entry = new int[10]; //create a dynamic array

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

Write a C++ program that can delete an element from an array. The user nominates the values to save in the array (as in Assignment 1). The element that has to be removed from the array (nth element) is also provided by the user. The program must ensure that the value for n is valid. After the value has been deleted, the array must be displayed to the user again. Tip: To erase an element, the elements are moved to overwrite the nth element. Note that the array can now save one more position than there are elements. The number of "active" elements in the array must be updated every time.

4. Suppose you set up a smart array with an initial capacity of 5, with a DOUBLING of capacity every time there is a resize. What would be the average number of units of work per add, in the course of performing 100 adds? Assume the same work units as the previous exercise.

What is the best way to implement a dynamic array if you don't know how many elements will be added? Create a new array with double the size any time an add operation would exceed the current array size. Create a new array with 1000 more elements any time an add operator would exceed the current size. Create an initial array with a size that uses all available memory Block (or throw an exception for) an add operation that would exceed the current maximum array size.