Question

Queue data structure works on the principle of ____________

(a) Last In First Out (LIF0)

(b) First In Last Out (FILO)

(c) First In First Out (FIFO)

(d) Last In Last Out (LILO)

This question was addressed to me in semester exam.

My question is based upon Static vs Dynamic Memory Allocation topic in section Dynamic Memory Allocation in C of C

Answer 1

Right option is (c) First In First Out (FIFO)

Easy explanation - Queue is a linear data structure which works on the principle of first in first out. This means that the first element to be inserted in a queue will be the first one to be removed.