+1 vote
in Data Structures & Algorithms I by (110k points)
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) Queue

(b) Stack

(c) Tree

(d) Linked list

The question is from Queue Operations topic in section Abstract Data Types of Data Structures & Algorithms I

This question was posed to me at a job interview.

1 Answer

+1 vote
by (412k points)
selected by
Best answer
The correct option is (a) Queue

For explanation: Linear list of elements in which deletion is done at front side and insertion at rear side is called Queue. In stack we will delete the last entered element first.

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.