Scribd
Upload
3 views3 pages

Circular Queue Code

The document contains a C program that implements a circular queue with basic operations such as enqueue, dequeue, and display. It defines a queue of a fixed size and includes functions to check if the queue is full or empty. The main function demonstrates the usage of these operations by enqueuing and dequeuing elements while displaying the queue's state.

Uploaded by

sejal
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
3 views3 pages

Circular Queue Code

The document contains a C program that implements a circular queue with basic operations such as enqueue, dequeue, and display. It defines a queue of a fixed size and includes functions to check if the queue is full or empty. The main function demonstrates the usage of these operations by enqueuing and dequeuing elements while displaying the queue's state.

Uploaded by

sejal
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

#include<stdio.

h>

#define size 5

int items[size];

int rear = -1, front = -1;

int isFull(){

if((front==(rear+1))||(front==0 && rear==(size-1))){

return 1;

return 0;

int isEmpty(){

if(front==-1){

return 1;

return 0;

void enqueue(int element){

if(isFull()){

printf("\nQueue is Full!\n");

else{

if(front==-1){

front = 0;

rear = (rear+1)%size;

items[rear] = element;

printf("\nInserted->%d", element);

int dequeue(){

int element;

if(isEmpty()){

printf("\nQueue is Empty!\n");

return -1;
}

else{

element = items[front];

if(front==rear){

rear = front = -1;

else{

front = (front+1)%size;

printf("\nDeleted Element->%d\n", element);

return (element);

void display(){

int i;

if(isEmpty()){

printf("\nEmpty Queue\n");

else{

printf("\nFront->%d", front);

printf("\nItems->");

for(i = front; i!=rear; i = (i+1)%size){

printf("%d", items[i]);

printf("%d", items[i]);

printf("\nRear->%d\n", rear);

int main(){

dequeue();

enqueue(1);

enqueue(2);

enqueue(3);
enqueue(4);

enqueue(5);

enqueue(6);

display();

dequeue();

display();

enqueue(7);

display();

enqueue(8);

return 0;

OUTPUT:

You might also like