Chapter 21.6, Problem 21.6CP

Program Plan Intro

Queue:

The 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.

• The queue is opened at its both ends. One end is for inserting items to the queue called a “rear” end and the other end is for removing the items from the queue called a “front” end.
• The two basic operations done on a queue data structure 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.
• When the “dequeue()” method is invoked on a queue, it checks whether the queue is empty or not. If queue is empty, it throws the exception.
  • If the queue is not empty, then elements are deleted from the front end in first-in-first-out order.