Data Structure Questions and Answers-Queue Operations

 

 Buy/Download all MCQ Ebook   >>>Click Here<<<

Data Structure Questions and Answers-Queue Operations

Click on any option to know the CORRECT ANSWERS

Question 1
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?
A
Queue
B
Stack
C
Tree
D
Linked list


Question 2
The data structure required for Breadth First Traversal on a graph is?
A
Stack
B
Array
C
Queue
D
Tree


Question 3
A queue is a?
A
FIFO (First In First Out) list
B
LIFO (Last In First Out) list
C
Ordered array
D
Linear tree


Question 4
In Breadth First Search of Graph, which of the following data structure is used?
A
Stack
B
Queue
C
Linked list
D
None of the mentioned


Question 5
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?
A
ABCD
B
DCBA
C
DCAB
D
ABDC


Question 5 Explanation: 
Queue follows FIFO approach.

There are 5 questions to complete.

 

 Buy/Download all MCQ Ebook >>>CLICK HERE<<<