On which principle does queue work?

Options
- FILO
- FIFO
- LILO
- Both a and b


CORRECT ANSWER : FIFO

Discussion Board
Data structure

All

Aqib 01-2-2019 01:43 AM

what is queue

queue is a linear data structure queue has 2 end REAR = used for insertion,FRONT = used for deletion and QUEUE follows FIFO or LILO
principles.

manisha 06-14-2018 08:18 AM

Data Structure - Queue

Queue is a linear data structure where the first element is inserted from one end called REAR and deleted from the other end called as FRONT. Queue follows the FIFO (First - In - First Out) structure. According to its FIFO structure, element inserted first will also be removed first. Front points to the beginning of the queue and Rear points to the end of the queue.

Prajakta Pandit 01-31-2017 12:26 AM

Answer

A queue is a container of objects (a linear collection) that are inserted and removed according to the first-in first-out (FIFO) principle

Pooja Gowda 10-3-2015 11:56 AM

Correct the answer plz

The answer should be either LIFO or FILO.;
Queues work on FIFO

Nikhil 08-3-2014 07:27 AM

wrong answer

stacks work on LIFO

Marium 06-11-2014 12:40 PM

correction

Stacks works on FILO or LIFO..the element which is first in will be last out.

farhan 02-17-2014 06:07 AM

mistake

stack operates based on the principle of lifo

athira 08-22-2013 06:08 AM

correction

the correct answer is lifo...(last in first out)
eg:the books arranged one above the other
pls correct

merin 08-22-2013 06:04 AM

verify answer

Stacks works on FILO or LIFO where queue works on FIFO or LILO. please correct ut database

ved verma 07-13-2013 06:57 AM

Write your comments


Enter the code shown above:

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


Advertisement