...
Graphs-and-Tree
November 12, 2023
Pipelining
November 12, 2023
Graphs-and-Tree
November 12, 2023
Pipelining
November 12, 2023

Question 11223 – Graphs-and-Tree

Which one of the following is blind search?

Correct Answer: C

Question 5 Explanation: 
Blind search algorithms have no additional information on the goal node other than the one provided in the problem definition. The plans to reach the goal state from the start state differ only by the order and/or length of actions.
Examples of blind search algorithms are:
1. Depth First Search
2. Breadth First Search
3. Uniform Cost Search
A
Breadth first search
B
Depth first search
C
Breadth first search and Depth first search
D
None of the given options

Leave a Reply

Your email address will not be published. Required fields are marked *