COMPUTER SCIENCE AND ENGINEERING
DATA STRUCTURES
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
stack
|
|
|
dequeue
|
|
|
queue
|
|
|
none
|
Detailed explanation-1: -Dequeue (double-ended queues) are the refined queues in which elements can be added or removed at either end but not in the middle.
Detailed explanation-2: -Explanation: Linear list of elements in which deletion is done at front side and insertion at rear side is called Queue.
Detailed explanation-3: -A linked list is a linear collection of data elements, whose order is not given by their physical placement in memory. Instead, each element points to the next.
Detailed explanation-4: -Answer: A. Queue Ans. “Queue is an abstract data type or a linear data structure, in which the first element is inserted from one end called REAR(also called tail), and the deletion of existing element takes place from the other end called as FRONT(also called head).
Detailed explanation-5: -Queue has two ends in which one end is used for the insertion and another end is used for the deletion.