Which search uses only the linear space for searching?
a) Best-first search
b) Recursive best-first search
c) Depth-first search
d) None of these
Explanation: Recursive best-first search will mimic the operation of standard best-first search, but using only the linear space.
Which method is used to search better by learning?
a) Best-first search
b) Depth-first search
c) Metalevel state space
d) None of the mentioned
Explanation: This search strategy will help to problem solving efficiency by using learning.
Which search is complete and optimal when h(n) is consistent?
a) Best-first search
b) Depth-first search
c) Both Best-first & Depth-first search
d) A* search
Which is used to improve the performance of heuristic search?
a) Quality of nodes
b) Quality of heuristic function
c) Simple form of nodes
d) None of the mentioned
Explanation: Good heuristic can be constructed by relaxing the problem, So the performance of heuristic search can be improved.
Which search method will expand the node that
is closest to the goal?
a) Best-first search
b) Greedy best-first search
c) A* search
d) None of these
Explanation: Because of using greedy best-first search, It will quickly lead to the solution of the problem.
