An array V[15][30] is stored in the memory Location  with each of the element occupying 8 bytes, If the base address of V is 5300, Find out the memory location of  V[8][12], and V[12][2] if the array is stored along the row.

An array Arr[50][10] is stored in the memory along the row with each of the element occupying 2 bytes.Find out the base address and address of element Arr[20][50], if an element Arr[10][25] is stored at the memory location 10000.

An array p[15][10] is stored along the column in the memory wich each element requiring 4 bytes of storage. if the base address of array P is 1400, find out the location of P[8][5].

Write a function in ALTERSUM (int B[][5], int N, int M) in C++ to find and return the sum of elements from all alternates elements of a two dimensional array starting fromB[0][0].

Write a DSUM() Function in c++ to find sum of diagonal elements of a N*N matrix.

Write a Get1From2() function in c++ to transfer the content from two array FIRST[] and SECOND[] to array ALL[].the even places(0,2,4...) of array ALL[] should get the content from the array First[] and odd places (1,3,5,...) of the array ALL[] should get the content from the array SECOND[].
e.g if the FIRST[]array contain
       30,60,90
and the SECOND[] array contains
       10,50,80
 The ALL[] array should contain
       30,10,60,50,90,80

Consider a queue of size 5.Insert elements 2,4,6,8 and then delete first two elements.After deleting, insert 10,12 in the queue.Show the status of Front and Rear in each step.

What do Front and Rear signify in a queue? if in a queue, the Rear points to the Front, how many elements are there in queue?

Write a function in C++ to perform push operation on a synamically allocated stack considering the following:
struct Node
{
  int X<Y;
  Node *Link;
};
class STACK
{
  Node *Top;
  public:
     STACK(){Top=NULL:}
     void PUSH();
     void POP();
     STACK();
};
     

Write a function POPBOOK() in C++ to perform delete operation from a dynamic stack,which contains Bno and Title.Consider the following definition of NODE,while writing your C++ code.
struct NODE
{
  int Bno;
  char Title[20];
  NODE *Link;
};

Write a function QDELETE() in C++ to perform delete operation on a Linked Queue, which contains Passenger number and Passenger name.Consider the following definition of node in the code:
struct node
{
  long int Pno;
  char Pname[20];
  node *Link;
};
 

How wil you know that a linear queue is full?

Suppose a data structure is stored in a circular queue with N memory locations what will be the queue full condition?

Write the output of the following program:
#include<iostream.h>
static int i=100;
void Print(char *p)
{
 p="pass";
 cout<<"Value is"<<p<,end1;
}
void main()
{
  char *q="Best of Luck";
  print(q);
  cout<<"New value is"<<q;
}

Give the output of the following program(assume all required header files are include in the program).
void main()
{
  int array[]={2,3,4,5};
  int *arptr=array;
  int value=*arptr;
  cout<<value<"\n";
  value=*arptr++;
  cout<<value<"\n";
  value=*arptr;
  cout<<value<<"\n";
  value=*++arptr;
  cout<,value<<"\n";
}
   

Find the output of the following program:
#include<iostream.h>
void main()
{
  int Moves[]={11,22,33,44},*Queen;
  Queen=Moves;
  Moves[2]+=22;
  cout<<"Queen@<<*Queen<<end1;
  *Queen-=11;|
   Queen+=2;
   cout<<"Now@"<<*Queen<<end1;
   Queen++;
   cout<<"Finally@"<<*Queen<<end1;
   cout<<"New origine@"<<*Moves[0]<<end1;
}

Find the output of the following program:
#include<iostream.h>
struct score
{
  int Year;
  float topper;
};
void change9Score *s,int x=20)
{
   s->topper=(s->topper+25)-x;
   s->Year++;
}
void main()
{
   Score Arr[]={{2007,100},{2008,95}};
   Score *point=Arr;
   chang (point,50);
   cout<<Arr[0].year<<"#"Arr[0].topper<<end1;
   chang(++point);
   cout<<point->Year<<"#"<<Point->topper<<end1;
}

Give the output of the following program segment:(Assume all desired  header file(s) are already included)
void main()
{
  float *ptr,Ponts[]={20,50,30,40,10};
  Ptr=points;
  cout<<*ptr<<end1;
  ptr+=2;
  ponits[2]+=2.5;
  cout<<*ptr<<end1;
  ptr++;
  (*ptr)+=2.5;
  cout<<points[3]<<end1;
}