COMPUTER SCIENCE AND ENGINEERING
DATA STRUCTURES
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
FIFO (First In First Out )
|
|
|
LIFO (Last In First Out)
|
|
|
Random
|
|
|
FILO(First In Last Out)
|
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. The insertion of an element in a queue is called an enqueue operation and the deletion of an element is called a dequeue operation.
Detailed explanation-2: -A Queue is defined as a linear data structure that is open at both ends and the operations are performed in First In First Out (FIFO) order. We define a queue to be a list in which all additions to the list are made at one end, and all deletions from the list are made at the other end.
Detailed explanation-3: -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: -Last-In-First-Out In a LIFO data structure, the newest element added to the container will be processed first. Sometimes this will be called a stack and is usually pictured as below. The new element is always added at the end of the stack.