COMPUTER SCIENCE AND ENGINEERING
DATA STRUCTURES
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
AVIV
|
|
|
VIVA
|
|
|
VAVI
|
|
|
IVAV
|
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: -Dequeue Operation Dequeue means removing an element from the queue. Since queue follows the FIFO principle we need to remove the element of the queue which was inserted at first.
Detailed explanation-3: -Queue is an abstract data type or a linear data structure, in which the first element is inserted from one end called the rear, and the removal of existing element takes place from the other end called as front.
Detailed explanation-4: -Dequeue (double-ended queues) are the refined queues in which elements can be added or removed at either end but not in the middle.