+1 vote
in Data Structures & Algorithms I by (110k points)
A data structure in which elements can be inserted or deleted at/from both ends but not in the middle is?

(a) Queue

(b) Circular queue

(c) Dequeue

(d) Priority queue

Asked question is from Queue Operations in portion Abstract Data Types of Data Structures & Algorithms I

The question was asked in examination.

1 Answer

+1 vote
by (412k points)
selected by
Best answer
Correct answer is (c) Dequeue

The best I can explain: In dequeuer, we can insert or delete elements from both the ends. In queue, we will follow first in first out principle for insertion and deletion of elements. Element with least priority will be deleted in a priority queue.

Related questions

Welcome to TalkJarvis QnA, a question-answer community website for the people by the people. On TalkJarvis QnA you can ask your doubts, curiosity, questions and whatever going in your mind either related to studies or others. Experts and people from different fields will answer.