Question

Q 2 - Queue data structure works on

A - LIFO

B - FIFO

C - FILO

D - none of the above

​

Answer 1

Answer:

D) None of these ...

This is the answer .!

Answer 2

Answer:

FIFO

Explanation:

Queue is an abstract data structure, somewhat similar to Stacks. One end is always used to insert data and the other is used to remove data. Queue follows First-In-First-Out methodology, i.e., the data item stored first will be accessed first.