Queue using Exception Handling


#include<iostream.h>
#include<conio.h>
#define MAX 4
class queue
{
private:
int arr[MAX];
int front,rear;
public:
class qfull
{
};
class qempty
{
};
queue()
{
front=-1;
rear=-1;
}
void addq(int item)
 {
 if(rear==MAX-1)
 throw qfull();
 rear++;
 arr[rear]=item;
 if(front==-1)
 front=0;
 }
 int delq()
 {
 int data;
 if(front==-1)
 throw qempty();
 data=arr[front];
 if(front==rear)
 front=rear=-1;
 else
 front++;
 return data;
 }
 };
 void main()
 {
 queue a;
 try
 {
 a.addq(11);
 a.addq(12);
 a.addq(13);
 a.addq(14);
 a.addq(15);
 }
 catch(queue::qfull)
 {
 cout<<endl<<"Queue is full";
 }
 int i;
 try
 {
 i=a.delq();
 cout<<endl<<"Item deleted="<<i;
 i=a.delq();
 cout<<endl<<"Item deleted="<<i;
 i=a.delq();
 cout<<endl<<"Item deleted="<<i;
 i=a.delq();
 cout<<endl<<"Item deleted="<<i;
 }
 catch(queue::qempty)
 {
	 cout<<endl<<"Queue is empty";
 }
 }