An array circular queue[10] of integers exixt,where currently
Rear=0, Front=1
Answer the following questions based on the above given data:
(i) How many values arte there in queue?
(ii) If five valuesare deleted,whatwould be the new value of Front?

How wil you know that a linear queue is full?

What are the drawbacks of linear queue?

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

Write a function in c++, with accept an integer array and its size as parameters and replace the elements having odd values with the thrice its value and the element having even with twice its values.

e.g.If an array contains the elements as 3,4,5,16,9. then the function should rearrange the array as 9,8,15,32,27

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].

Obtain the output from the following C++ program as expected to appear on the screen after its exection.
Important note
  All the desired header files are alraedy included in the code, which are required to run the code.
   void main()
   {
     char *Text="AJANTA";|
     int *P.Num[]=[1,5,7,9];
     P=Num;
     cout<<*P<      Text++;
     P++;
     cout<<*P<    }

Give the output of the following program segment (assume all required header files are include in the program)
void main()
{
  char *NAME="a ProFile";
  for(int x=0;x<strlen(NAME);x++)
      if(islower(NAME[x]));
      else
      if(isupper(NAME[x]))
         if(x%2!=0)
            NAME[x]=tolower(NAME[x-1]);
         else
            NAME[x]--;
  cout<<NAME<<end1;
}  

Why are parentheses needed to specify the order of operations in infix expression but not in postfix expression?

Evaluate the following postfix notation of expression:
True,False,NOT,AND,True,True,AND,OR

Evaluate the following postfix expression showing the status after execution of each step:
10,40,+,8,2,+,*,10,-

Evaluate the following postfix expression using a stack.Show the contains of stack after execution of each operation.
TRUE,FALSE,TRUE,FALSE,NOT,OR,TRUE,OR,OR,AND

Write a function QINSERT() in C++ to perform insert operation on a linked queue, which contains client no and Client name.Consider the following definition of NODE in the code of QINSERT():
struct NODE
{
     long int Cno;              //Client number
     char Cname[20];        //Client name
     NODE *Next;
};

Write a function in C++ to insert an element in a dynamically allocated queue,where each node contains a Name(char) as data.Assume the following definition of THENODE for the same:
structTHENODE
{
  char Name[20];
  THENODE *Link;
};

Write a function in C++ to perform push operation on a dynamically allocated stack containing real numbers.

Given the following class:
char *msg[]={:overflow"."underflow"};
class stack
{
  int top;//the stack pointer
  int stk[5];//the elements
  void err_rep(int e_num)
  {
    cout<   }
        //report error message
  public:
     void init(){top=0;}
        //initialise the stack pointer
     void push(int);
        //put new value in stack
     void pop();
        //get the pop value
};
Define pop outside the stack.In your definition take care of underflow condition. Function pop should invoke error_rep to report underflow

Write a function in C++ to perform push operation in a dynamically allocated stack containing admission numbers of students. Also,declare the relevant class/structure and points.