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) Tree

C) Stack

D) Linked list

Correct Answer : Queue

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.

Top Trending Technologies MCQ's

Machine Learning

Artificial Intelligence

Ethical Hacking

Microsoft Azure

Cloud Computing

Quantum Computing

Neural Networks

Natural Language Processing

Virtual Reality

Augmented Reality

Top Trending Technologies Interview Questions

Machine Learning

Artificial Intelligence

Ethical Hacking

HyperAutomation

Microsoft Azure

Cloud Computing

Quantum Computing

Cognitive Computing

Neural Networks

Virtual Reality

Augmented Reality

Full Stack Developer