Question 4887 – UGC NET CS 2018-DEC Paper-2
November 30, 2023Question 6579 – KVS PGT 2017 Paper 1
November 30, 2023Question 4888 – UGC NET CS 2018-DEC Paper-2
Consider the following statements related to AND-OR Search algorithm.
S 1 : A solution is a subtree that has a goal node at every leaf.
S 2 : OR nodes are analogous to the branching in a deterministic environment
S 3 : AND nodes are analogous to the branching in a non-deterministic environment.
Which one of the following is true referencing the above statements?
Choose the correct answer from the code given below:
Correct Answer: B
Question 21 Explanation:
● An and–or tree is a graphical representation of the reduction of problems (or goals) to conjunctions and disjunctions of subproblems (or subgoals).
● A solution in an AND-OR tree is a sub tree whose leaves are included in the goal set
● A solution in an AND-OR tree is a sub tree whose leaves are included in the goal set
S1- False, S2- True, S3- True
S1- True, S2- True, S3- True
S1- False, S2- True, S3- False
S1- True, S2- True, S3- False
Subscribe
Login
0 Comments