One of the following options is a form of access used to add and remove nodes from a queue.
a. LIFO
b. FIFO
c. Both LIFO and FIFO
d. None of these
Answer: a;
Queues are first in first out.
In a FIFO data structure, the first element added to the queue will be the first one to be removed.
a. LIFO
b. FIFO
c. Both LIFO and FIFO
d. None of these
Answer: a;
Queues are first in first out.
In a FIFO data structure, the first element added to the queue will be the first one to be removed.