Q. A* Search Algorithm _____
✅ Correct Answer: (B)
finds the shortest path through the search space using the heuristic function i.e f(n)=g(n) + h(n)
Artificial Intelligence and Robotics (AIR) MCQs and Notes
Q. Which property asks that the algorithm is locally admissible?
✅ Correct Answer: (B)
monotonicity
Q. ____________________requires Linear Space but uses backtracking
✅ Correct Answer: (B)
recursive best first search (rbfs)
Q. What is true about variable neighborhood function?
✅ Correct Answer: (D)
all of the above
Q. What is the termination criteria in Hill climbing?
✅ Correct Answer: (A)
when no successor of the node has better heuristic value.
Q. The efficiency of A* algorithm depends on _____________
✅ Correct Answer: (B)
the quality of heuristic
Q. Admissibility of the heuristic function is given as
✅ Correct Answer: (D)
h(n)<= h*(n)
Q. Which search strategy is combining the benefits of both BFS and DFS?
✅ Correct Answer: (B)
iterative deepening depth first search
Q. If there is a solution, breadth first search is _______________to find it
✅ Correct Answer: (B)
guaranteed
Q. Which of the following are Informed search algorithms?
✅ Correct Answer: (D)
both a & b