How do circular queues work?

Can you explain how circular queues work?

Sure! A circular queue is a linear data structure that follows the FIFO principle but connects the end back to the front.

What are the advantages of using a circular queue?

Circular queues are efficient in utilizing space, as they allow for continuous use of the array without needing to shift elements.

How do you implement a circular queue in programming?

You can implement a circular queue using an array and two pointers: one for the front and one for the rear of the queue.

Can you give me a code example?

Certainly! Here's a simple implementation in Python:

class CircularQueue:
    def __init__(self, size):
        self.size = size
        self.queue = [None] * size
        self.front = self.rear = -1

    def enqueue(self, value):
        if (self.rear + 1) % self.size == self.front:
            print('Queue is full!')
        elif self.front == -1:
            self.front = self.rear = 0
            self.queue[self.rear] = value
        else:
            self.rear = (self.rear + 1) % self.size
            self.queue[self.rear] = value

    def dequeue(self):
        if self.front == -1:
            print('Queue is empty!')
        elif self.front == self.rear:
            temp = self.queue[self.front]
            self.front = self.rear = -1
            return temp
        else:
            temp = self.queue[self.front]
            self.front = (self.front + 1) % self.size
            return temp

What happens when the queue is full?

When the queue is full, any attempt to enqueue a new element will result in an error or a message indicating that the queue is full.