42. 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

Answer: a
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.

Leave a Reply

Your email address will not be published.