A circular queue is a linear data structure that allows data insertion at the rear and removal from…

A circular queue is a linear data structure that allows data insertion at the rear and removal from the front, with the rear end connected to the front end forming a circular arrangement. Given below are the details of class MerryGoRound Class name : MerryGoRound Data members/instance variables: q[ ] : an array to hold integers cap : to store the maximum capacity of the array front : to point the index of the front end rear : to point the index of the rear end Methods/Member functions: MerryGoRound(int n) : parameterised constructor to initialise cap = n, front = rear = 0 void add(int val) : to add integers from the rear index if possible, else display the message "QUEUE IS FULL" int remove( ) : to remove and return the integer from front if any, else return -999 void display( ) : to display the elements of the circular queue in the order of front to rear

void add(int val)
{
    if ((rear + 1) % cap == front)
        System.out.println("QUEUE IS FULL");
    else
    {
        q[rear] = val;
        rear = (rear + 1) % cap;
    }
}

int remove()
{
    if (front == rear)
        return -999;
    int val = q[front];
    front = (front + 1) % cap;
    return val;
}