1. What is the other name of informed search strategy?
a) Simple search
b) Heuristic search
c) Online search
d) None of the mentioned
Explanation: A key point of informed search strategy is heuristic function, So it is called as heuristic function.
2. 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.
3. 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.
4. 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.
5. 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)
Explanation: f(n) = h(n)
6. 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 the mentioned
Explanation: Recursive best-first search will mimic the operation of standard best-first search, but using only the linear space.
7. 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.
8. 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
Explanation: A* search
9. 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.
10. 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 the mentioned
Explanation: Because of using greedy best-first search, It will quickly lead to the solution of the problem.