retagged by
658 views

4 Answers

3 votes
3 votes

A queue is a "First In First out" (FIFO) abstract data structure. Whatever is inserted first in the queue is removed first.

Whenever in doubt, think of it as a real queue in front of a ticket booth. Whoever gets first in the line, gets the ticket first. 

2 votes
2 votes
A)Lifo- last in first out - the last element added will be removed first.

B)Lilo-last in last out - the last element added will be removed at last.

C)Filo - first in last out - the fist element added will be removed at last.

D)Fifo - first in first out - the first element added will be removed first.

 

Now queue is a data structure where the first element added will be removed first  or we can say that last element added will be removed after removing all the element(except last) means the last element will be removed at last.

So queue is both FIFO and LILO.

SO OPTION (B) AND (D) IS CORRECT.

Related questions

0 votes
0 votes
2 answers
1
rishu_darkshadow asked Sep 22, 2017
3,669 views
In a full binary tree of height k, there are ______ internal nodes .2k-1 2k-1 2k 2k+1
1 votes
1 votes
1 answer
2
rishu_darkshadow asked Sep 22, 2017
1,425 views
In which addressing mode the operand is given explicitly in the instruction itself ?Absolute mode Immediate mode Indirect mode Index mode
0 votes
0 votes
1 answer
3
rishu_darkshadow asked Sep 22, 2017
571 views
In a B tree of order m with p nodes the average number of splits is at most :1/(⌈m/2⌉−1) ⌈m/2⌉−1 1/(m/2) None
2 votes
2 votes
2 answers
4
rishu_darkshadow asked Sep 21, 2017
766 views
A binary tree is said to have heap property if the elements along any path :from leaf to root are non-increasing from leaf to root are non-decreasing from root to l...