What is queue? Why it is known as FIFO? Explain insert and delete operations onsimple queue.

A queue is a data structure that follows the First-In-First-Out (FIFO) principle. It is called FIFO because the element that is inserted first is the first one to be removed.

To insert an element into a simple queue, we follow these steps:

1. Check if the queue is full. If it is, then the insertion is not possible.
2. If the queue is not full, increment the rear pointer by 1.
3. Assign the new element to the position pointed by the rear pointer.

To delete an element from a simple queue, we follow these steps:

1. Check if the queue is empty. If it is, then the deletion is not possible.
2. If the queue is not empty, increment the front pointer by 1.
3. Remove the element from the position pointed by the front pointer.

These steps ensure that the elements are inserted at the rear end and removed from the front end, maintaining the FIFO order.