KIDS QUIZ
ROBOTS AND ARTIFICIAL INTELLIGENCE
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
Depth-first search
|
|
|
Breadth-first search
|
|
|
Bidirectional search
|
|
|
None of the mentioned
|
Detailed explanation-1: -In breadth-first search the frontier is implemented as a FIFO (first-in, first-out) queue. Thus, the path that is selected from the frontier is the one that was added earliest. This approach implies that the paths from the start node are generated in order of the number of arcs in the path.
Detailed explanation-2: -Explanation: The Breadth First Search Algorithm searches the nodes on the basis of level. It takes a node (level 0), explores it’s neighbors (level 1) and so on. Explanation: The Breadth First Search explores every node once and every edge once (in worst case), so it’s time complexity is O(V + E).
Detailed explanation-3: -A blind search (also called an uninformed search) is a search that has no information about its domain. The only thing that a blind search can do is distinguish a non-goal state from a goal state.