Question: Which data structure is used in breadth first search of a graph to hold nodes?
Given Answer: B
Suggestion for Correct Answer: A B C D
Question: Identify the data structure which allows deletions at both ends of the list but insertion at only one end.
Given Answer: A
Question: In a queue, the initial values of front pointer f rare pointer r should be
Question: In a circular queue the value of r will be ..
Given Answer: C
Question:
Given Answer: D
Question: Which of the following is not the type of queue?
Question: A data structure where elements can be added or removed at either end but not in the middle is called
Question: A
Question: In a priority queue, insertion and deletion takes place at
Question: A data structure where elements can be added or removed at either end but not in the middle
191 Points
54 Points
53 Points
52 Points
49 Points