edited by
995 views
0 votes
0 votes

​​​​​​​Consider the following statements related to $AND-OR$ Search algorithm.

S1 : A solution is a subtree that has a goal node at every leaf.

S2 : $OR$ nodes are analogous to the branching in a deterministic environment.

S3 : $AND$ nodes are analogous to the branching in a non-deterministic environment.

Which of the following is true referencing the above statements ?

Choose the correct answer from the code given below :

$Code:$

  1. $S1 – False, S2 – True, S3 – True$
  2. $S1 – True, S2 – True, S3 – False$
  3. $S1 – True, S2 – True, S3 – True$
  4. $S1 – False, S2 – True, S3 – False$
edited by

1 Answer

0 votes
0 votes
S1 – True,

S2 – False (it must be deterministic),

S3 – True.

Related questions

1 votes
1 votes
0 answers
3
0 votes
0 votes
2 answers
4
Arjun asked Jan 2, 2019
4,385 views
Consider the graph shown below:Use Kruskal’s algorithm to find the minimum spanning tree of the graph. The weight of this minimum spanning tree is$17$$14$$16$$13$