Question

what is the technique that is used to perform work in FIFO in data structure​

Answer 1

Answer:

FIFO is an abbreviation for first in, first out. It is a method for handling data structures where the first element is processed first and the newest element is processed last.

$\huge\mathfrak \blue{examples}$

• There is a ticket counter where people come, take tickets and go.
• People enter a line (queue) to get to the Ticket Counter in an organized manner.
• The person to enter the queue first, will get the ticket first and leave the queue.
• The person entering the queue next will get the ticket after the person in front of him
• In this way, the person entering the queue last will the tickets last

Therefore, the First person to enter the queue gets the ticket first and the Last person to enter the queue gets the ticket last.

This is known as First-In-First-Out approach or FIFO.

$\huge{\fcolorbox{blue}{black}{\pink{\:hope\:this\:helps\:u}}} \:$