Which of the following statements is true? Select all that apply.
BFS is complete if the branching factor b is finite. |
||
The tree-search version of DFS is not complete even if the branching factor b and the depth d are finite. |
||
BFS is always optimal under any circumstances. |
||
Both versions of DFS (tree-search and graph-search) are non-optimal. |
1) BFS is complete if the branching factor b is finite.
TRUE
when the Breadth first search's branching factor b is finite t reaches the goal
2)The tree-search version of DFS is not complete even if the branching factor b and the depth d are finite.
FALSE
its not true because DFS is complete when its search space is finite
3) BFS is always optimal under any circumstances
FALSE
its not true because BFS is only optimal if step costs is increasing with depth
4)Both versions of DFS (tree-search and graph-search) are non-optimal
TRUE
yes since it is not optimal by nature , both the versions of DEPTH FIRST SEARCH i.e tree search and graph searcg are non -optimal
***please give a like if you are satisfied with the answer. if you have any doubts or you need any further information ask me through comments***
Get Answers For Free
Most questions answered within 1 hours.