Correct Answer : Option (B) : FIFO memory
Explanation : FIFO stands for First In - First Out. The queue is a type of memory based on FIFO, which means the request which has come first will be dealt with first. For example, the line of a crowd for booking railway tickets. The person who came first will get the ticket first. In the case of a Queue data structure, we call an ordinary queue as a FIFO queue.
