Home > Artificial Intelligence > Quizzes > Artificial Intelligence Practice Test: Informed Search and Exploration
Artificial Intelligence Practice Test: Informed Search and Exploration
Fast practice, instant feedback. Timer auto-submits when time’s up.
Avg score: 66% Most missed: “A heuristic is a way of trying which of the following?”

The algorithms of an informed search contain information regarding the goal state. It helps an AI make more efficient and accurate searches. A function obtains this data/info to estimate the closeness of a state to its goal in the system.

For example, Graph Search and Greedy Search.

Artificial Intelligence Practice Test: Informed Search and Exploration
Time left 00:00
10 Questions

1. Which of the following is the evaluation function in the greedy technique?
2. Heuristic function h(n) is …….?
3. A* is optimal if h(n) is an allowable heuristic-that is, providing that h(n) under no circumstances underestimates the cost to reach the goal.
4. Greedy search strategy chooses the node for expansion in which of the following?
5. Which of the following is the space complexity of Greedy search?
6. A heuristic is a way of trying which of the following?
7. Best-First search is a type of informed search, that uses which of the following to choose the best next node for expansion.
8. We can implement the Best First search with the help of which data structure
9. Uninformed search strategies are better than informed search strategies.
10. Which of the following is the evaluation function in the A* technique?