BCS1223 Data Structure And Algorithms

#include
#include
using namespace std;
#define SIZE 5
int q[SIZE],front=0,rear=0;

void enqueue()
{
   int no;
   if (rear==SIZE && front==0)
      cout<<"queue is full";
   else
   {
      cout<<"enter the num:";
      cin>>no;
      q[rear]=no;
   }
   rear++;
}

void dequeue()
{
   int no,i;
   if (front==rear)
   cout<<"queue is empty";
   else
   {
      no=q[front];
      front++;
      cout<<"\n"<   }
}

void display()
{
   int i,temp=front;
   if (front==rear)
   cout<<"the queue is empty";
   else
   {
      cout<<"\n element in the queue:";
      for(i=temp;i       {
          cout<       }
   }
}

int main(int argc, char *argv[])
{
   int ch;
   //clrscr();
   while(1)
   {
      cout<<"\n 1.add element";
      cout<<"\n 2.remove element";
      cout<<"\n 3.display";
      cout<<"\n 4.exit";
      cout<<"\n enter your choice:";
      cin>>ch;
      //clrscr();
      switch(ch)
      {
        case 1:
        enqueue();
        break;
        case 2:
        dequeue();
        break;
        case 3:
        display();
        break;
        case 4:
        exit(0);
        default:
        cout<<"\n invalid choice";
      }//switch
   }//while
 
    system("PAUSE");
    return EXIT_SUCCESS;
}