Data Structure Questions and Answers-Queue Operations
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?
The data structure required for Breadth First Traversal on a graph is?
A queue is a?
FIFO (First In First Out) list
LIFO (Last In First Out) list
In Breadth First Search of Graph, which of the following data structure is used?
None of the mentioned
If the elements "A", "B", "C" and "D" are placed in a queue and are deleted one at a time, in what order will they be removed?
Question 5 Explanation:
Queue follows FIFO approach.
There are 5 questions to complete.