A Queue is a linear data structure that stores a collection of elements. The queue operates on first in first out (FIFO) algorithm. This article will help you explore Queue In C
Following pointers will be covered in this article,
- Analogy For Queue
- Operations On A Queue
- Sample Code For Queue In C
- Insert Function
- Delete Function
- Display Function
- Limitations Of This Implementation
Analogy For Queue
You are visiting a doctor for a check-up. There are many people at the clinic. A lady is entering the names of all the people in a file. The person who comes first gets places first. When the doctor is free, he calls the first patient inside. This is a queue and follows a first in first out method as the first person to enter his name in the list gets treated first.
The people who are treated their names are removed from the list. This is how a queue works.
There are 2 pointers, the front is at the front of the queue and rear is at the back of the queue. We add elements from the back of the queue and remove them from the front of the queue.
Moving on with this article on Queue In C,
Operations On A Queue
- Enqueue- adding an element in the queue if there is space in the queue.
- Dequeue- Removing elements from a queue if there are any elements in the queue
- Front- get the first item from the queue.
- Rear- get the last item from the queue.
- isEmpty/isFull- checks if the queue is empty or full.
Applications
- A queue is used in scheduling processes in a CPU.
- It is used in data transfer between processes.
- It holds multiple jobs which are then called when needed.
Moving on with this article on Queue In C,
Sample Code For Queue In C
#include <stdio.h>
#include<stdlib.h>
#define MAX 50
void insert();
void delete();
void display();
int queue_array[MAX];
int rear = - 1;
int front = - 1;
int main()
{
int choice;
while (1)
{
printf("1.Insert element to queue n");
printf("2.Delete element from queue n");
printf("3.Display all elements of queue n");
printf("4.Quit n");
printf("Enter your choice : ");
scanf("%d", &choice);
switch(choice)
{
case 1:
insert();
break;
case 2:
delete();
break;
case 3:
display();
break;
case 4:
exit(1);
default:
printf("Wrong choice n");
}
}
}
void insert()
{
int item;
if(rear == MAX - 1)
printf("Queue Overflow n");
else
{
if(front== - 1)
front = 0;
printf("Inset the element in queue : ");
scanf("%d", &item);
rear = rear + 1;
queue_array[rear] = item;
}
}
void delete()
{
if(front == - 1 || front > rear)
{
printf("Queue Underflow n");
return;
}
else
{
printf("Element deleted from queue is : %dn", queue_array[front]);
front = front + 1;
}
}
void display()
{
int i;
if(front == - 1)
printf("Queue is empty n");
else
{
printf("Queue is : n");
for(i = front; i <= rear; i++)
printf("%d ", queue_array[i]);
printf("n");
}
}
Explanation
This code is a menu-driven implementation of a queue. First, define the size of MAX variable to be 50. Then, the array called queue_array is declared of size MAX. There are three functions that are to be declared. The functions are, insert, display and delete functions. A menu-driven main function is used. The user is asked to enter his choice and call the appropriate function to perform the task.
There are 2 pointers, the front is at the front of the queue and rear is at the back of the queue. We add elements from the back of the queue and remove them from the front of the queue.
Moving on with this article on Queue In C,
Insert Function
void insert()
{
int item;
if(rear == MAX - 1)
printf("Queue Overflow n");
else
{
if(front == - 1)
front = 0;
printf("Inset the element in queue : ");
scanf("%d", &item);
rear = rear + 1;
queue_array[rear] = item;
}
}In the insertion part, First, declare an item which is to be added. The user will enter the item. Check if the queue is full, if yes give the overflow message or else check if the queue is empty. The rear is then incremented by one and the at the location rear add the new item.
Moving on with this article on Queue In C,
Delete Function
void insert()
{
int item;
if (rear == MAX - 1)
printf("Queue Overflow n");
else
{
if (front == - 1)
front = 0;
printf("Inset the element in queue : ");
scanf("%d", &item);
rear = rear + 1;
queue_array[rear] = item;
}
}
In the delete part, check again if the queue is empty. If yes, print underflow error. Otherwise, print the first element, that is the element that will be deleted and increment front. This is how the deletion takes place.
Moving on with this article on Queue In C,
Display Function
void display()
{
int i;
if(front == - 1)
printf("Queue is empty n");
else
{
printf("Queue is : n");
for(i = front; i <= rear; i++)
printf("%d ", queue_array[i]);
printf("n");
}
}
Just display the queue like how an array. Check if the queue is empty here as well. A Queue has a complexity of O(1) as no loops are present in any operation.
Moving on with this article on Queue In C,
Limitations Of This Implementation
Consider a queue, with size 5. We have entered 5 elements but have later deleted first 2 elements. Now there is a problem. We have free space but, space won’t be used as we can’t traverse again. This problem is solved using the circular queue.
This brings us to the end of this article on Queue In C.
With this we come to the end of this article on ‘Queue In C’. I hope you found this informative and helpful, stay tuned for more tutorials on similar topics.You may also checkout our training program to get in-depth knowledge on jQuery along with its various applications, you can enroll here for live online training with 24/7 support and lifetime access.Implement the above code with different strings and modifications. Now, we have a good understanding of all key concepts related to the pointer.
Got a question for us? Mention them in the comments section of this article and we will get back to you.