C++ program for Circular Queue

-

Circular queue

In a normal Queue Data Structure, we can insert elements until queue becomes full. But once queue becomes full, we can not insert the next element until all the elements are deleted from the queue.

Circular Queue is a linear data structure in which the operations are performed based on FIFO (First In First Out) principle and the last position is connected back to the first position to make a circle.

Program:

#include<iostream>
#include<stdlib.h>
using namespace std;
int siz,front=0,rear=0;
void insert(int q[],int n)
{
    if(front==1&&rear==siz||front==rear+1)
    {cout<<"Overflow ";
    exit(0);}
    else if (rear==0)
        front=rear=1;
    else if(rear==siz)
        rear=1;
    else rear++;
        q[rear]=n;

}
void del(int q[])
{int rak;
    if(front==0)
        {cout<<"Underflow ";exit(0);}
    rak=q[front];
    if(front==rear)
    front=rear=0;
    else if (front==siz)
        front=1;
    else front++;
cout<<"\nDeleted element is "<<del;
}
void display(int q[])
{
    for(int r=front;r<rear;r++)
        cout<<q[r]<<"<-";
            cout<<q[rear];
}
main()
{
    int raks,c;
    char ch;
    cout<<"Enter size of queue ";
    cin>>siz;
    int q[siz];
    do
    {
        cout<<"Enter data to create a queue ";
        cin>>raks;
        insert(q,raks);
        cout<<"The queue is  ";
        display(q);
        cout<<"\nWant to insert more elements ";
        cin>>ch;
    }while(ch=='y'||ch=='Y');
    cout<<"Enter choice \n1.Insertion \n2.Deletion ";
    cin>>c;
    switch(c)
    {
        case 1:do
    {
        cout<<"Enter data to insert ";
        cin>>raks;
        insert(q,raks);
        cout<<"\nThe queue is ";
        display(q);
        cout<<"\nWant to insert more elements ";
        cin>>ch;
        }while(ch=='y'||ch=='Y');
        break;
    case 2:
    cout<<"\n-----Deletion-----";
    do{
            del(q);
            cout<<"\nThe queue is   ";
    display(q);
    cout<<"\nWant to delete more ";
    cin>>ch;
    }while(ch=='y'||ch=='Y');

    break;
    default:cout<<"\nWrong choice ";

    }
    cout<<"\nThe queue is ";
    display(q);
    }

Comments

Post a Comment

Popular posts from this blog

C++ program for linked lists

-
Image
  Linked lists  A linked list is a linear data structure where each element is a separate object. Each node  of a list is comprising of two items - the data and a reference to the next node. The last node has a reference to  null .  The entry point into a linked list is called the head  of the list. It should be noted that head is not a separate node, but the reference to the first node. If the list is empty then the head is a null reference. A linked list is a dynamic data structure. The number of nodes in a list is not fixed and can grow and shrink on demand.  One disadvantage of a linked list against an array is that it does not allow direct access to the individual elements. If you want to access a particular item then you have to start at the head and follow the references until you get to that item. Program: #include<iostream> using namespace std; struct node{ int info ; node *next ; }*t; node *head=NU...
Read more

C++ program for Queue

-
Image
Queue A queue is a container of objects (a linear collection) that are inserted and removed according to the first-in first-out (FIFO) principle. An excellent example of a queue is a line of students in the food court.  New additions to a line made to the back of the queue, while removal (or serving) happens in the front.  In the queue only two operations are allowed insertion  and  deletion .  Insertion means to insert an item into the back of the queue. Deletion means removing the front item.  The picture demonstrates the FIFO access. The difference between stacks and queues is in removing. In a stack we remove the item the most recently added; in a queue, we remove the item the least recently added. Program: #include<iostream> #include<stdlib.h> using namespace std; int siz,front=0,rear=0; void insert(int q[],int n) {     if(rear==siz)         {cout<<"Overflow ";exit...
Read more