Question

1. What is the likely results of running the following code fragment? Why? int *ptr = (int *) 0xfeedbeef ; *ptr = 0 ;
2. Suppose a class uses a dynamically-allocated integer array, pointed to by an int* variable named data. The current capacity of the array is stored in the integer variable capacity. The following code fragment is meant to dyamically resize the array, doubling its capacity. What is the major memory error and how would you detect it? int *tmp = new int[2 * capacity] ; for (int i = 0; i < capacity; i++) { tmp[i] = data[i] ; } data = tmp ; capacity = 2 * capactiy ;

Answer 1

#include <iostream>
using namespace std;
int main()
{
   int set[10];
   int *ptr=set;

   ptr++;

   ptr = set;
*(ptr + 5) = 7; //*(ptr+1) points to the array of second element *(ptr+5) points to the sixth element of an aarray

cout<<"value of set[5]is:" << set[5] <<endl;
   return 0;
}

*****************

ptr = set;
*(ptr + 5) = 7; //*(ptr+1) points to the array of second element *(ptr+5) points to the sixth element of an aarray

cout<<"value of set[5]is:" << set[5] <<endl;
this is the statements required to run the code.

*****************

Output::