Queue as an ADT

Here is the key explanation of Queue as an ADT:

The queue abstract data type is defined by the following structure and operations. A queue is structured is an ordered collection of items which are added at one end, called the “rear,” and removed from the other end, called the “front.” Queues maintain a FIFO ordering property.

Element insertion is restricted to the back of sequence as queue follows FIFO principal.

The Queue abstract data type (ADT) Supports the following two update methods:

1. enqueue(): adds a new item to the rear of the queue. It needs the item and returns nothing.
2. dequeue(): removes the front item from the queue. It needs no parameters and returns the item. The queue is modified.

The queue ADT also includes the following accessor methods:

1. isEmpty(): tests to see whether the queue is empty. It needs no parameters and returns a boolean value.
2. size(): returns the number of items in the queue. It needs no parameters and returns an integer.
3. first(): returns the first element of the queue, without removing it.