COMPUTER SCIENCE AND ENGINEERING
DATA STRUCTURES
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
LIFO principle
|
|
|
FIFO principle
|
|
|
Linear tree
|
|
|
Ordered array
|
Detailed explanation-1: -The queue data structure follows the FIFO (First In First Out) principle, i.e. the element inserted at first in the list, is the first element to be removed from the list.
Detailed explanation-2: -A queue is a container of objects (a linear collection) that are inserted and removed according to the first-in first-out (FIFO) principle.
Detailed explanation-3: -Stack is a container of objects that are inserted and removed according to the last-in first-out (LIFO) principle. Queue is a container of objects (a linear collection) that are inserted and removed according to the first-in first-out (FIFO) principle.
Detailed explanation-4: -A queue is structured, as an ordered collection of items which are added at one end, called the “rear, ” and removed from the other end, called the “front.” Queues maintain a FIFO ordering property.
Detailed explanation-5: -Queue uses FIFO principle. Explanation: Element first added in queue will be deleted first which is FIFO principle.