Question

How does FIFO describe queue?

Answer 1

FIFO means First In First Out. FIFO defines queues, because in queue, elements are inserted at rear and deleted at front. So the element inserted first in queue is deleted first, and the element inserted at last removed last, i.e FIFO order.