All Notes on BCA

#include<stdio.h>
#include<conio.h>
#include<stdlib.h>
#define max 5

int front=0,rear=-1;
int queue[max];

void main()
{
int ch,i;
while(1)
{
clrscr();
printf("1. Insertion\n2. Deletion\n3. Display\n4. Exit\n\nEnter your Choice : ");
scanf("%d",&ch);
switch(ch)
{
case 1:
clrscr();
if(rear == max-1)
printf("Queue Overflow !!!!");
else
{
rear++;
printf("Enter Element : ");
scanf("%d",&queue[rear]);
}
getch();
break;
case 2:
clrscr();
if(front>rear)
printf("Queue Underflow !!!!");
else
{
printf("%d is deletion element",queue[front]);
front++;
}
getch();
break;
case 3:
clrscr();
if(front>rear)
printf("Queue Underflow !!!!");
else
for(i=front;i<=rear;i++)
{
printf("\n %d",queue[i]);
}
getch();
break;
case 4:
exit(0);
break;
}
}
}

 
OUTPUT 
 1. INSERT 
 2. DELETE 
 3. DISPLAY 
 4. EXIT
  Enter Your Choice : 1
  ENTER Element : 50

 1. INSERT 
 2. DELETE 
 3. DISPLAY 
 4. EXIT
  Enter Your Choice : 1
  ENTER Element : 100

 1. INSERT 
 2. DELETE 
 3. DISPLAY 
 4. EXIT
  Enter Your Choice : 1
  ENTER Element : 150

 1. INSERT 
 2. DELETE 
 3. DISPLAY 
 4. EXIT
  Enter Your Choice : 1
  ENTER Element : 200

 1. INSERT 
 2. DELETE 
 3. DISPLAY 
 4. EXIT
  Enter Your Choice : 1
  ENTER Element : 250

 1. INSERT 
 2. DELETE 
 3. DISPLAY 
 4. EXIT
  Enter Your Choice : 1
  QUEUE OVERFLOW!!!!!!!!!!!!!!!

 1. INSERT 
 2. DELETE 
 3. DISPLAY 
 4. EXIT
  Enter Your Choice : 3
  Queue Elements :
  50 
  100
  150
  200
  250

 1. INSERT 
 2. DELETE 
 3. DISPLAY 
 4. EXIT
  Enter Your Choice : 2
  50 is deletion element

 1. INSERT 
 2. DELETE 
 3. DISPLAY 
 4. EXIT
  Enter Your Choice : 2
  100 is deletion element
 
 1. INSERT 
 2. DELETE 
 3. DISPLAY 
 4. EXIT
  Enter Your Choice : 2
  150 is deletion element

 1. INSERT 
 2. DELETE 
 3. DISPLAY 
 4. EXIT
  Enter Your Choice : 2
  200 is deletion element

 1. INSERT 
 2. DELETE 
 3. DISPLAY 
 4. EXIT
  Enter Your Choice : 2
  250 is deletion element
 
 1. INSERT 
 2. DELETE 
 3. DISPLAY 
 4. EXIT
  Enter Your Choice : 2
  QUEUE UNDERFLOW