FIFO principle works on Queue - Data Structure

Q.  Which principle works on Queue?
- Published on 25 Aug 15

a. FILO
b. FIFO
c. LILO
d. Both a and b above

ANSWER: FIFO

Related Content

 

    Discussion

  • nilesh   -Posted on 07 Jul 19
    correct answer is a & c
    FIFO & LILO both are answer
  • Nihal   -Posted on 01 Apr 16
    Queue is linear data structure that works on FIFO (First in First Out) principle means element inserted first will also be removed first from queue. It has two pointer called rear and front respectively. The new element is inserted at the rear end and the deletion is done at the other end called front.

➨ Post your comment / Share knowledge


Enter the code shown above:

(Note: If you cannot read the numbers in the above image, reload the page to generate a new one.)
▲