Question 31 : In A* approach evaluation function is
1. Heuristic function
2. Path cost from start node to current node
3. Path cost from start node to current node + Heuristic cost
4. Average of Path cost from start node to current node and Heuristic cost
View Answer   Discuss with Members

Question 32 : What is the space complexity of Greedy search?
1. O(
2. b) O(bl)
3. O(m)
4. O(bm)
View Answer   Discuss with Members

Question 33 : In greedy approach evaluation function is
1. Heuristic function
2. Path cost from start node to current node
3. Path cost from start node to current node + Heuristic cost
4. Average of Path cost from start node to current node and Heuristic cost
View Answer   Discuss with Members

Question 34 : Greedy search strategy chooses the node for expansion
1. Shallowest
2. Deepest
3. The one closest to the goal node
4. Minimum heuristic cost
View Answer   Discuss with Members

Question 35 : Heuristic function h(n) is ____
1. Lowest path cost
2. Cheapest path from root to goal node
3. Estimated cost of cheapest path from root to goal node
4. Average path cost
View Answer   Discuss with Members

Question 36 : Best-First search can be implemented using the following data structure.
1. Queue
2. Stack
3. Priority Queue
4. Circular Queue
View Answer   Discuss with Members

Question 37 : Best-First search is a type of informed search, which uses ________________ to choose the best next node for expansion.
1. Evaluation function returning lowest evaluation
2. Evaluation function returning highest evaluation
3. Evaluation function returning lowest & highest evaluation
4. None of them is applicable
View Answer   Discuss with Members

Question 38 : Uninformed search strategies are better than informed search strategies.
1. True
2. False
3.
4.
View Answer   Discuss with Members

Question 39 : The search strategy the uses a problem specific knowledge is known as
1. Informed Search
2. Best First Search
3. Heuristic Search
4. All of the mentioned
View Answer   Discuss with Members

Question 40 : A* algorithm is based on
1. Breadth-First-Search
2. Depth-First -Search
3. Best-First-Search
4. Hill climbing
View Answer   Discuss with Members