Question 21 : Which of the following data structure is used to implement DFS?
1. linked list
2. tree
3. stack
4. queue
5.
View Answer   Discuss with Members

Question 22 : Regarding implementation of Depth First Search using stacks, what is the maximum distance between two nodes present in the stack? (considering each edge length 1)
1. Can be anything
2. 0
3. At most 1
4. Insufficient Information
View Answer   Discuss with Members

Question 23 : When the Depth First Search of a graph is unique?
1. When the graph is a Binary Tree
2. When the graph is a Linked List
3. When the graph is a n-ary Tree
4. None of the mentioned
5.
View Answer   Discuss with Members

Question 24 : What can be the applications of Depth First Search?
1. For generating topological sort of a graph
2. For generating Strongly Connected Components of a directed graph
3. Detecting cycles in the graph
4. All of the mentioned
5.
View Answer   Discuss with Members

Question 25 : The Data structure used in standard implementation of Breadth First Search is?
1. Stack
2. Queue
3. Linked List
4. None of the mentioned
5.
View Answer   Discuss with Members

Question 26 : Depth First Search is equivalent to which of the traversal in the Binary Trees?
1. Pre-order Traversal
2. Post-order Traversal
3. Level-order Traversal
4. In-order Traversal
5.
View Answer   Discuss with Members

Question 27 : Regarding implementation of Breadth First Search using queues, what is the maximum distance between two nodes present in the queue? (considering each edge length 1)
1. Can be anything
2. 0
3. At most 1
4. Insufficient Information
View Answer   Discuss with Members

Question 28 : Regarding implementation of Depth First Search using stacks, what is the maximum distance between two nodes present in the stack? (considering each edge length 1)
1. Can be anything
2. 0
3. At most 1
4. Insufficient Information
View Answer   Discuss with Members

Question 29 : Breadth First Search is equivalent to which of the traversal in the Binary Trees?
1. Pre-order Traversal
2. Post-order Traversal
3. Level-order Traversal
4. In-order Traversal
View Answer   Discuss with Members

Question 30 : Who published the first A* search algorithm?
1. Peter Hart
2. Nils Nilsson
3. Bertram Raphael
4. Hans Berliner
View Answer   Discuss with Members