C Circular Queue 🎯

Welcome to our deep dive into C Programming! Today, let's explore the concept of Circular Queue, a crucial data structure in computer science.

What is a Circular Queue? 📝

A Circular Queue is a variant of a linear queue that uses a circular buffer for storing data. The main advantage of a circular queue is that it makes efficient use of memory.

💡 Pro Tip: In a circular queue, the buffer acts as if it's connected end-to-end, forming a circle. This way, we can store data beyond the last position, making the queue circular.

Why Use a Circular Queue? 💡

Efficient use of memory: Since the buffer in a circular queue is circular, we can reuse the buffer space when it gets filled, making it ideal for memory-constrained systems.
Simplified handling of overflow and underflow: In a linear queue, overflow and underflow errors can occur when the queue is full or empty. However, in a circular queue, these issues are automatically handled due to its circular nature.

Circular Queue Implementation in C 🎯

To implement a circular queue in C, we need the following components:

Queue structure definition
Function to initialize the circular queue
Functions to add elements to the queue (enqueue)
Function to remove elements from the queue (dequeue)
Function to check if the queue is empty
Function to check if the queue is full
Function to display the contents of the queue

Let's see an example of how to implement a circular queue in C:

#include <stdio.h>
#include <stdlib.h>

#define MAX 5

typedef struct {
    int items[MAX];
    int front;
    int rear;
} Queue;

void initialize(Queue* q) {
    q->front = q->rear = -1;
}

int isEmpty(Queue* q) {
     return (q->front == -1);
}

int isFull(Queue* q) {
    return ((q->rear + 1) % MAX == q->front);
}

void enqueue(Queue* q, int data) {
    if (!isFull(q)) {
        if (isEmpty(q)) {
            q->front = q->rear = 0;
        } else {
            q->rear = (q->rear + 1) % MAX;
        }
        q->items[q->rear] = data;
    } else {
        printf("The queue is full.\n");
    }
}

void dequeue(Queue* q) {
    if (!isEmpty(q)) {
        q->front = (q->front + 1) % MAX;
    } else {
        printf("The queue is empty.\n");
    }
}

void display(Queue* q) {
    if (!isEmpty(q)) {
        int i = q->front;
        do {
            printf("%d ", q->items[i]);
            i = (i + 1) % MAX;
        } while (i != q->rear);
    } else {
        printf("The queue is empty.\n");
    }
}

int main() {
    Queue q;
    initialize(&q);

    enqueue(&q, 10);
    enqueue(&q, 20);
    enqueue(&q, 30);
    enqueue(&q, 40);
    enqueue(&q, 50);

    printf("Queue: ");
    display(&q);

    dequeue(&q);
    printf("\nAfter removing an element: ");
    display(&q);

    return 0;
}

Quiz 💡

Now you have a basic understanding of C Circular Queue and its implementation! Keep learning and practicing to master this essential data structure. Happy coding! 👩‍💻💻