Home »
MCQs »
Artificial Intelligence MCQs
Consider the following statement: 'The search first begins from the root node and the first one of the child node's sub-tree is completely traversed. That is, first all the one-sided nodes are checked, and then the other sided nodes are checked' Which search algorithm is described in the above definition?
34. Consider the following statement:
"The search first begins from the root node and the first one of the child node's sub-tree is completely traversed. That is, first all the one-sided nodes are checked, and then the other sided nodes are checked."
Which search algorithm is described in the above definition?
- The Breadth First Search (BFS)
- The Depth First Search (DFS)
- The A* search
- None of the above
Answer: B) The Depth First Search (DFS)
Explanation:
In DFS, the search first begins from the root node and the first one of the child node's sub-tree is completely traversed. That is, first all the one-sided nodes are checked, and then the other sided nodes are checked.