Scribd Logo
Upload

Welcome to Scribd!

  • 2 views

    Circular Queue

    Uploaded by

    lakshmi shree
    circular queue

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd

    Circular Queue

    Uploaded by

    lakshmi shree
    2 views5 pages
    circular queue

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    circular queue

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    2 views5 pages

    Circular Queue

    Uploaded by

    lakshmi shree
    circular queue

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    You are on page 1of 5

    Circular Queue | Set 1 (Introduction and Array Implementation)

    Prerequisite – Queues
    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. It is also called ‘Ring Buffer’.

    In a normal Queue, we can insert elements until queue becomes full. But once queue becomes
    full, we can not insert the next element even if there is a space in front of queue.

    Operations on Circular Queue:


     Front: Get the front item from queue.
     Rear: Get the last item from queue.
     enQueue(value) This function is used to insert an element into the circular queue. In a
    circular queue, the new element is always inserted at Rear position.
    Steps:
    1. Check whether queue is Full – Check ((rear == SIZE-1 && front == 0) || (rear == front-
    1)).
    2. If it is full then display Queue is full. If queue is not full then, check if (rear == SIZE –
    1 && front != 0) if it is true then set rear=0 and insert element.
     deQueue() This function is used to delete an element from the circular queue. In a circular
    queue, the element is always deleted from front position.
    Steps:
    1. Check whether queue is Empty means check (front==-1).
    2. If it is empty then display Queue is empty. If queue is not empty then step 3
    3. Check if (front==rear) if it is true then set front=rear= -1 else check if (front==size-1),
    if it is true then set front=0 and return the element.

    Circular Queue

     In a circular queue, all nodes are treated as circular. Last node is connected back to the first
    node.
     Circular queue is also called as Ring Buffer.
     It is an abstract data type.
     Circular queue contains a collection of data which allows insertion of data at the end of the
    queue and deletion of data at the beginning of the queue.
    The above figure shows the structure of circular queue. It stores an element in a circular way and
    performs the operations according to its FIFO structure.

    Example: Program for Circular Queue

    #include<stdio.h>
    #include<cstdlib>
    #define max 6
    int q[10],front=0,rear=-1;
    int main()
    {
    int ch;
    void insert();
    void delet();
    void display();

    printf("\nCircular Queue Operations\n");


    printf("1.Insert\n2.Delete\n3.Display\n4.Exit\n");
    while(1)
    {
    printf("Enter Your Choice:");
    scanf("%d",&ch);
    switch(ch)
    {
    case 1: insert();
    break;
    case 2: delet();
    break;
    case 3:display();
    break;
    case 4: exit(0);
    default:printf("Invalid option\n");
    }
    }
    }
    void insert()
    {
    int x;
    if((front==0&&rear==max-1)||(front>0&&rear==front-1))
    printf("Queue is Overflow\n");
    else
    {
    printf("Insert Element :");
    scanf("%d",&x);
    if(rear==max-1&&front>0)
    {
    rear=0;
    q[rear]=x;
    }
    else
    {
    if((front==0&&rear==-1)||(rear!=front-1))
    q[++rear]=x;
    }
    }
    }
    void delet()
    {
    int a;
    if((front==0)&&(rear==-1))
    {
    printf("Queue is Underflow\n");
    exit(0);
    }
    if(front==rear)
    {
    a=q[front];
    rear=-1;
    front=0;
    }
    else
    if(front==max-1)
    {
    a=q[front];
    front=0;
    }
    else a=q[front++];
    printf("Deleted Element is : %d\n",a);
    }
    void display()
    {
    int i,j;
    if(front==0&&rear==-1)
    {
    printf("Queue is Underflow\n");
    exit(0);
    }
    if(front>rear)
    {
    for(i=0;i<=rear;i++)
    printf("\t%d",q[i]);
    for(j=front;j<=max-1;j++)
    printf("\n \t%d",q[j]);
    printf("\nRear is at %d\n",q[rear]);
    printf("\nFront is at %d\n",q[front]);
    }
    else
    {
    for(i=front;i<=rear;i++)
    {
    printf("\t%d",q[i]);
    }
    printf("\nRear is at %d\n",q[rear]);
    printf("\nFront is at %d\n",q[front]);
    }
    printf("\n");
    }

    Output:

    1.Insert

    2. Display

    3. Delete

    You might also like