Chapter 21, Problem 2SA

Explanation of Solution

Queue:

A queue is a linear data structure used to store a set of data and is the collection of data that uses FIFO (first-in-first-out) order for performing operations.

• Queue is opened at both its ends. One end is for inserting items to the queue called “rear” end and the other end is for removing the items from the queue called “front” end.
• Two basic operations done on queue are,
  • enqueue() – add an item to queue.
  • dequeue() – remove an item from the queue.
• When the “enqueue()” method is invoked, it checks whether the queue is full or not.
  • If the queue is full, it throws an exception.
  • If the queue has slots available, then element is added at the “rear” end...