Examveda

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)

Answer: Option C


This Question Belongs to C Program >> Memory Allocation

Join The Discussion

Related Questions on Memory Allocation