#include <iostream.h>
const int size=10;
class Queue
{
  private:
	  int Front;
	  int rear;
	  int q[size];
  public:
	  Queue(); 
      void enQueue(int newData);
	  void delQueue();
	  bool isEmpty();
	  bool isFull();  
	  void print();

};

Queue::Queue()
{ Front=0; rear=-1;}
 void Queue:: enQueue(int D)
 {
	 if(!isFull() )
	 {
		 rear++;
		 q[rear]= D;
	 }
	 else
		 cout<<"Queue is full"<<endl;
 }

 void Queue::delQueue()
 {
	 if(!isEmpty() )
	 {
		int x=q[Front];
		    Front++;
			cout<<x<<endl;
	 }
	 else
		 cout<<"Queue is empty"<<endl;
 }

  bool Queue::isEmpty()
 {
	 if(rear < Front )

		return true;
	else
		return false;
  }
  bool Queue::isFull()
 {
	 if(rear==size-1 )

		return true;
	else
		return false;
  }

   void Queue::print()
   {
	   for(int i=Front; i<=rear;i++)
		   cout<<q[i]<<endl;
   }

  void main()
  {
	  Queue E;

	 int choice;
	do
	{
		cout<<"1.Etern Queue"<<endl;
		cout<<"2.Delet Queue "<<endl;
		cout<<"3.isEmpty "<<endl;
		cout<<"4.isFull   "<<endl;
		cout<<"5.Print the List "<<endl;
		cout<<"0.Eixit the Programe"<<endl;

		cout<<"Enter YOUR CHOICE, PLEASE : "<<endl;
		cin>>choice;

		switch(choice)
		{
		case 1:
			int X;
			cout<<"Enter one entry ";
			cin>>X;
			 E.enQueue(X);
			 E.print();
			break;

		case 2:
			E.delQueue();
            E.print();

			break;

		case 3:
			E.isEmpty();
            E.print();

			break;
		case 4:
			E.isFull();
            E.print();

			break;
		case 5:
			E.print();

			break;
		case 0:
			cout<<"This is the end of the program"<<endl;

			break;
		}
	}
		while(choice!=0);
  }