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
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
Explanation: Linear list of elements in which deletion is done at the front side and insertion at the rear side is called Queue. In stack, we will delete the last entered element first.