What is circular Queue? Write a C code to insert anelement in circular Queue and condition for full andemptiness of circular Queue

A circular queue is a data structure that follows the First-In-First-Out (FIFO) principle. It is implemented using an array and two pointers, front and rear. The front pointer points to the first element in the queue, and the rear pointer points to the last element in the queue.

To insert an element in a circular queue using C code, you can follow these steps:

1. Declare an array to hold the elements of the circular queue and initialize the front and rear pointers to -1.
2. Check if the circular queue is full by comparing the condition (rear + 1) % size == front, where size is the maximum number of elements the circular queue can hold. If the condition is true, the circular queue is full.
3. If the circular queue is not full, increment the rear pointer by 1 and assign the new element to the rear position in the array.
4. If the front pointer is -1 (indicating an empty circular queue), set the front pointer to 0.
5. Repeat steps 2-4 until all the elements are inserted into the circular queue.

To check if the circular queue is empty, you can use the condition front == -1.

Here is an example of C code to insert an element in a circular queue:

#include <stdio.h>

#define SIZE 5

int circularQueue[SIZE];
int front = -1;
int rear = -1;

void insert(int element) {
    if ((rear + 1) % SIZE == front) {
        printf("Circular Queue is full. Insertion not possible.\n");
    } else {
        rear = (rear + 1) % SIZE;
        circularQueue[rear] = element;
        if (front == -1) {
            front = 0;
        }
        printf("Element %d inserted successfully.\n", element);
    }
}

int main() {
    insert(10);
    insert(20);
    insert(30);
    insert(40);
    insert(50);
    insert(60); // Circular Queue is full. Insertion not possible.

    return 0;
}

In this code, the insert function is used to insert an element into the circular queue. The main function demonstrates the usage of the insert function by inserting elements into the circular queue.