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

Question 42 : Which of the following is an example of Best First Search algorithm?
1. A*
2. B*
3. C*
4. Both A* and B*
View Answer   Discuss with Members

Question 43 : Which algorithm is used to find the least cost path from source node to destination node?
1. A* BFS
2. C* BFS
3. D* BFS
4. B* BFS
View Answer   Discuss with Members

Question 44 : Choose the incorrect statement about DFS and BFS from the following?
1. BFS is equivalent to level order traversal in trees
2. DFS is equivalent to post order traversal in trees
3. DFS and BFS code has the same time complexity
4. BFS is implemented using queue
View Answer   Discuss with Members

Question 45 : The Breadth First Search traversal of a graph will result into?
1. Linked List
2. Tree
3. Graph with back edges
4. All of the mentioned
View Answer   Discuss with Members

Question 46 : A person wants to visit some places. He starts from a vertex and then wants to visit every vertex till it finishes from one vertex, backtracks and then explore other vertex from same vertex. What algorithm he should use?
1. Depth First Search
2. Breadth First Search
3. Trim's algorithm
4. None of the mentioned
View Answer   Discuss with Members

Question 47 : Is Best First Search a searching algorithm used in graphs.
1. True
2. False
3.
4.
View Answer   Discuss with Members

Question 48 : Which of the following is the greedy best first search?
1. Pure Heuristic Search
2. A*
3. B*
4. Both A* and B*
View Answer   Discuss with Members

Question 49 : 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 50 : Which of the following traversal in a binary tree is similar to depth first traversal?
1. level order
2. post order
3. pre order
4. in order
View Answer   Discuss with Members