What is the other name of informed search strategy?
a) Simple search
b) Heuristic search
c) Online searches
d) None of these
Explanation: A key point of informed search strategy is heuristic function, So it is called as heuristic function.
How many types of informed search method are in artificial intelligence?
a) 1
b) 2
c) 3
d) 4
Explanation: The four types of informed search method are best-first search, Greedy best-first search, A* search and memory bounded heuristic search.
Which search uses the problem specific knowledge beyond the definition of the problem?
a) Informed search
b) Depth-first search
c) Breadth-first search
d) Uninformed search
Explanation: Informed search can solve the problem beyond the function definition, So does it can find the solution more efficiently.
Which function will select the lowest expansion node at first for evaluation?
a) Greedy best-first search
b) Best-first search
c) Depth-first search
d) None of the mentioned
Explanation: The lowest expansion node is selected because the evaluation measures distance to the goal.
What is the heuristic function of greedy best-first search?
a) f(n) != h(n)
b) f(n) < h(n)
c) f(n) = h(n)
d) f(n) > h(n)
