Login/RegisterData Structures :: Queue - Discussion
Home > Data Structures > Queue > MCQs Questions Discussion
5 / 42
Choose the correct option.
A linear list of elements in which deletion can be done from one end (front) and insertion can take place only at the other end (rear) is known as a
Aqueue.
Bstack.
Ctree.
Dlinked list.
Answer: Option (Login/Signup)
Show Explanation
Asked In ::
SHORTCUT
Option B : Stack
because A linear list of elements in which deletion can be done from one end (front) and insertion can take place only at the other end (rear) is known as a "stack"
Read Full Answer
Report Error
Please Login First Click Here
STEP-BY-STEP
Queue is a linear data structure in which, the first element is inserted from one end called REAR and deleted from the other end called as FRONT. Also, one end is always used to insert data (enqueue) and the other is used to delete data (dequeue), because queue is open at both its ends.
Read Full Answer
Report Error
Please Login First Click Here
In a queue, one end is always used to insert data (enqueue) and the other is used to delete data (dequeue), because queue is open at both its ends.
Read Full Answer
Report Error
Please Login First Click Here
