Question 31 : Which type of best first search algorithm was used to predict the closeness of the end of path and its solution?
1. Greedy BFS
2. Divide and Conquer
3. Heuristic BFS
4. Combinatorial
View Answer   Discuss with Members

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

Question 33 : What can be the applications of Breadth First Search?
1. Finding shortest path between two nodes
2. Finding bipartiteness of a graph
3. GPS navigation system
4. All of the mentioned
View Answer   Discuss with Members

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

Question 35 : When the Breadth 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
View Answer   Discuss with Members

Question 36 : In Depth First Search, how many times a node is visited?
1. Once
2. Twice
3. Equivalent to number of indegree of the node
4. None of the mentioned
View Answer   Discuss with Members

Question 37 : What is the other name of the greedy best first search?
1. Heuristic Search
2. Pure Heuristic Search
3. Combinatorial Search
4. Divide and Conquer Search
View Answer   Discuss with Members

Question 38 : Time Complexity of Breadth First Search is? (V – number of vertices, E – number of edges)
1. O(V + E)
2. O(V)
3. O(E)
4. None of the mentioned
View Answer   Discuss with Members

Question 39 : Who described this Best First Search algorithm using heuristic evaluation rule?
1. Judea Pearl
2. Max Bezzel
3. Franz Nauck
4. Alan Turing
View Answer   Discuss with Members

Question 40 : 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
View Answer   Discuss with Members