Breaking News
recent

WAP to insert, delete and traverse a queue

#include<iostream.h>
#include<conio.h>
void main()
{
  clrscr();
  int queue[10],front=0,rear=0,n,item,ch;
  char choice;
  cout<<"Enter the size of Queue:  ";
  cin>>n;
 do

{
  cout<<"\n1.Insertion";
  cout<<"\n2.Deletion";
  cout<<"\n3.Traversing";
  cout<<"\nEnter your choice: ";
  cin>>ch;
  switch(ch)
  {
    case 1:
            if((front==1 && rear==n)||(front==rear+1))
            {
     cout<<"\nOverflow ! !";
      }
            else if(front==0)
            {
     front=1;
              rear=1;
              cout<<"\nInsert the element: ";
              cin>>item;
              queue[rear]=item;
            }
            else if(rear==n)
            {
     rear=1;
              cout<<"\nInsert an element: ";
              cin>>item;
              queue[rear]=item;
            }
            else
            {
     rear=rear+1;
              cout<<"\nInsert an element: ";
              cin>>item;
              queue[rear]=item;
            }
            break;
    case 2:
            if(front==0)
            {
   cout<<"\n Underflow!!!";
    }
   else if(front==rear)
            {
     front=0;
              rear=0;
            }
            else if(front==n)
            {
    front=1;
            }
            else
            {
    front=front+1;
            }
            break;
    case 3:
            if(front<=rear)
            {
   for(int i=front;i<=rear;i++)
              { cout<<queue[i]<<" ";
     }
            }
            if(front>rear)
            {
    for(int i=front;i<=n;i++)
              { cout<<queue[i]<<" ";
      }
              for(int i=1;i<=rear;i++)
              { cout<<queue[i]<<endl;
      }
            }
            break;
    default:
            cout<<"\nWrong Choice";
  }
cout<<"\nDo you wish to continue(Y/N): ";
cin>>choice;
}
while(choice=='y'||choice=='Y');
getch();

}

Output:


Unknown

Unknown

No comments:

Post a Comment

Powered by Blogger.