Home > Artificial Intelligence > Quizzes > Artificial Intelligence Practice Test: Uninformed Search Strategy
Artificial Intelligence Practice Test: Uninformed Search Strategy
Fast practice, instant feedback. Timer auto-submits when time’s up.
Avg score: 3% Most missed: “Which of the following search is implemented with an empty “first in the first o…”

Uninformed search is a class of general-purpose search algorithms which operates in brute force-way. Uninformed search algorithms do not have additional information about state or search space other than how to traverse the tree, so it is also called blind search.

Artificial Intelligence Practice Test: Uninformed Search Strategy
Time left 00:00
10 Questions

1. Which of the following is the space complexity of a Depth-first search?
2. Which of the following search is implemented with an empty “first in the first out queue”?
3. Breadth-first search is considered to be optimal when?
4. Total parts of a problem?
5. How many successors are produced in a backtracking search?
6. Which of the following artificial intelligence algorithm enforces a fixed depth limit on nodes?
7. Which of the following algorithm is used to solve any type of problem?
8. How many kinds are there in the uninformed search method?
9. Which of the following implements stack operation for the purpose of searching the states?
10. Which of the following strategy is commonly known as a blind search?