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 _____________
Options
A : Queue
B : Stack
C : Tree
D : Linked list
Click to view Correct Answer
Data Structure Queue Operations more questions
The most suitable data structure used to represent the derivations....
A push down automaton employs ________ data structure.
In what form does the STL provides heap?
A data structure that follows the FIFO principle.
A flowchart that outlines the main segments of a program.
Which data structure is used for implementing recursion?
Which is the most appropriate data structure for reversing a....
Which container is used to keep priority based elements?
Evolution is a ______ process.
A transducer must be __________
Data Structure Adjacency List more Online Exam Quiz
Data Structure Propositional Directed Acyclic Word Graph
Data Structure Queue Linked List