Q. How does FIFO describe queue?
Answer :-
Queues are the data structures where data is entered into the Queue at one end-the rear-end and deleted from the other end-the front, i.e., these follow first in, first out (FIFO) principle.
Answer :-
Queues are the data structures where data is entered into the Queue at one end-the rear-end and deleted from the other end-the front, i.e., these follow first in, first out (FIFO) principle.
Post a Comment
You can help us by Clicking on ads. ^_^
Please do not send spam comment : )