Question

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.

Answer 1

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.