1. A queue is a data structure that follows the First In, First Out (FIFO) principle.
  2. In a queue, the first element added is the first one to be removed.
  3. A queue is like a line of people waiting for a service.
  4. The person who arrives first is served first, and new people join the line at the end.

Operations:

  1. Enqueue (or Insert): Add an element to the back of the queue.

  1. Dequeue (or Remove): Remove the element from the front of the queue.

  1. Front: View the front (first) element without removing it.

  2. Rear (or Back): View the rear (last) element without removing it.

  3. Display - view the complete queue by displaying it to the console

  4. IsFull - check if the queue is full; if rear>= maxsize

  5. isempty - if front -1 or rear -1; queue is empty.