3) Answer the question with the correct options given below A) Which of the following statements correctly releases (deallocates) the memory from the dynamic array pointer to by p1? delete [] p1; delete p1[]; delete p1; delete *p1; B)Given that p1 is a pointer, p1++ always causes a run time error adds 1 to whatever p1 is pointing to adds one element to the array that p1 is pointing to advances p1 by one unit of the type of variable to which p1 points C) If p1 is a pointer to an integer at the location of 0x13131001, then (p1+1) evaluates to:?

3) Answer the question with the correct options given below A) Which of the following statements correctly releases (deallocates) the memory from the dynamic array pointer to by p1? delete [] p1; delete p1[]; delete p1; delete *p1; B)Given that p1 is a pointer, p1++ always causes a run time error adds 1 to whatever p1 is pointing to adds one element to the array that p1 is pointing to advances p1 by one unit of the type of variable to which p1 points C) If p1 is a pointer to an integer at the location of 0x13131001, then (p1+1) evaluates to:?

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter12: Points, Classes, Virtual Functions And Abstract Classes

Section: Chapter Questions

Problem 23SA

See similar textbooks

Similar questions

Write a single line of code that will accomplish the following: declare arr to be of type "pointer to a char" allocate a dynamic array of type char with capacity 4 assign the starting address of the array to arr HINT: Use conventional spacing (one space each side of the = operator) and don't forget your semicolon.
Question 2In the following program, there is a call to the print_in_reverse function whichhas the following prototype: void print_in_reverse(float *a, int count); Using pointers, write this function to print the array in reverse order. #include <stdio.h>#define A_SIZE(A) sizeof(A)/sizeof(A[0]) void print_in_reverse(float a[], int count);int main(void) { float values[6] = { 12.1F, 22.2F, 32.3F, 42.4F, 52.5F, 62.6F }; printf("The array in reverse\n"); print_in_reverse(values, A_SIZE(values)); return 0;}
3. Consider an 1-d array of type int and a pointer pointing variable pointing to the 2nd item of the array. Write down the code for the following: int arr(10) = (5,6,23,4,89,70,12,78,33); int *ptr = arr+1; (a) Print the first item of the array using ptr. (b) Print all prime numbers of the array using value at address. (c) Print the last item of the array using a pointer to an array. You are not allowed to initialize the pointer to the address of the last item. Iterate using a loop to change the value of the pointer. (d) Now print the array in reverse order using a pointer. 101
# //Write the assembly for the following loop# // Use indexed array access (no pointers)# const int AMAX = 15;# int A[] = {0,1,2,3,4,5,6,7,8,9,10,,11,12,13,14,15};# for (int i=AMAX; i > 0; i--) {# A[i-1] = A[i] * 2;.dataA: .word 0,1,2,3,4,5,6,7, .word 8,9,10,11,12,13,14,15AMAX: .word 15 .text.globl mainmain: #TODO: write the loop code: A[i+1] = A[i] * 2
I need help with this C++ problem. Assume that a binary search function is searching for a value that is stored in the middle element of an array. How many times will the function read and compare elements in the array before it finds the value?
Create two dynamic arrays A and B with random numbers.a) Merge B in array A calling a function by reference.b) Delete the Prime numbers from the merged array A calling a function by pointer.c) Print the Array A in ascending order.You have to use only two Arrays A and B throughout the code. Be carefulabout memory leakage.Example:A= [20, 30, 5, 7, 19]B= [19, 10, 15, 11, 17, 25] a) After merging B in A, the merged Array A will look like-A= [20, 30, 5, 7, 19, 19, 10, 15, 11, 17, 25] b) After deleting prime numbers the merged Array would look like-A= [20, 30, 10, 15, 25] c) Finally print the merged array in ascending orderA= [10, 15, 20, 30, 25] In C++ Please
Hello, I am having trouble with my c++ homework. Implement and grow a dynamic array using pointer arithmetic. a) Use the provided main function (see below). b) Implement a populate function which stores values from 0 to size into the array p using pointer arithmetic to access array locations. c) Implement a print function which prints the values of the array p using pointer arithmetic. d) Implement a printMemory function which prints the memory addresses of all elements in array p using pointer arithmetic. e) Implement a grow function which resizes the existing array from the initial size to a new size using pointer arithmetic. f) Verify via the output that the new array is a distinct memory space from the original array. Main: Output Example:Use the following main function to test your program. (cannot change the int main provided) int main(…
Write the code that dynamically allocates memory for an array of 10 integers and assigns its address to the pointer ptr. After that use that pointer to access the array and store on it the powers of two then display the content of the array on the screen. The output should be: 2 4 6 8 16 32 128 256 512 1024. Note: You can use the pow() function. This function takes two arguements and returns the result of the first argument raised to the power of the second arguement.
Assume that an array double v[10] has been declared and that its first element is at location 3020 in memory. Assume that pointer vPtr has been initialised to point to v[0]. vPtr =V vPtr =&v[0] Assume further that the machine with double bytes is used. What is the value of the following? vPtr +=3 vPtr -=5
Consider the following statement.double *sales;a. Write the C11 statement that dynamically creates an array of 50 components of type double and assigns the base address of the array to sales.b. Write a C11 code that inputs data into the array sales from the standard input device.c. Write a C11 code that finds the index of the largest entry in the array sales.d. Write a C11 statement that deallocates the memory space of array to which sales points.
(1) The following code transposes the elements of an M × M array, where M is a con- stant defined by # define: void transpose(long A[M][M]) { long i, j; for (i = 0; i < M; i++)for (j = 0; j < i; j++) { long t = A[i][j]; A[i][j] = A[j][i]; A[j][i] = t; } } When compiled, with optimization level −O1, GCC generates the following code for the inner loop of the function. 1 .L1: 234 5 6 7 8 9 movq movq movq movq addq addq cmpq jne .L1 (%rdx), %rcx (%rax), %rsi (%rdx) (%rax) $8, %rdx $120, %rax %rdi, %rax %rsi, %rcx, We can see that GCC has converted the array indexing to pointer code. (a) Which register holds a pointer to array element A[i][j]? (b) Which register holds a pointer to array element A[j][i]? (c) What is the value of M?
NEED IN C!!! 9. Write function getMoveRow to do the following a. Return type integer b. Parameter list i. 1-d character array (i.e. move), size 3 c. Convert the row portion of the player’s move to the associated integer index for the board array d. Example: i. move = ‘b2’ ii. 2 is the row iii. 2 is index 1 in the board array e. Return the row array index that corresponds to the player’s move f. Return a -1 if the row is not valid (i.e. INVALID)