C++ programs – Implement the Queue ADT using an array

by Nideesh C on April 14, 2011 · 0 comments

in C++




#include<iostream>
#include<conio.h>
#include<stdlib.h>
using namespace std;
 
class queue
{
              int queue1[5];
              int rear,front;
      public:
              queue()
                {
                     rear=-1;
                     front=-1;
                }
              void insert(int x)
               {
                   if(rear >  4)
                    {
                       cout <<"queue over flow";
                       front=rear=-1;
                       return;
                    }
                    queue1[++rear]=x;
                    cout <<"inserted" <<x;
               }
              void delet()
               {
                   if(front==rear)
                     {
                         cout <<"queue under flow";
                         return;
                     }
                     cout <<"deleted" <<queue1[++front];
                }
              void display()
               {
                   if(rear==front)
                     {
                          cout <<" queue empty";
                          return;
                     }
                   for(int i=front+1;i<=rear;i++)
                   cout <<queue1[i]<<" ";
               }
};
 
main()
{
      int ch;
      queue qu;
      while(1)
        {
              cout <<"\n1.insert  2.delet  3.display  4.exit\nEnter ur choice";
              cin >> ch;
              switch(ch)
                {
                  case 1:    cout <<"enter the element";
                           	 cin >> ch;
                             qu.insert(ch);
                             break;
                  case 2:  qu.delet();  break;
                  case 3:  qu.display();break;
                  case 4: exit(0);
                  }
          }
return (0);
}

OUTPUT
 1.insert  2.delet  3.display  4.exit
 Enter ur choice1
 enter the element21
 inserted21
 1.insert  2.delet  3.display  4.exit
 Enter ur choice1

enter the element22
 inserted22
1.insert  2.delet  3.display  4.exit
 Enter ur choice1
 enter the element16
 inserted16

1.insert  2.delet  3.display  4.exit
 Enter ur choice3
 21 22 16

1.insert  2.delet  3.display  4.exit
 Enter ur choice2
 deleted21

1.insert  2.delet  3.display  4.exit
 Enter ur choice3
 22 16

1.insert  2.delet  3.display  4.exit
 Enter ur choice



Not Satisfied ? Just search & get the result

Related Posts Plugin for WordPress, Blogger...
Be Sociable, Share!

Related posts:

  1. C++ program – Implement circular queue ADT using an array
  2. C++ program – Implement the Queue ADT using a single linked list
  3. C++ program to implement circular queue using array
  4. C++ program to implement Queue using Formula Based Representation
  5. C++ programs – Implement the Stack ADT using a singly linked list

Leave a Comment

Previous post:

Next post: