PREVIOUS YEAR SOLVED PAPERS - November 2017 Paper 3
- Option : C
- Explanation :
- In binary tree branching factor is 2 and space complexity for height n is O(2n).
- In ternary tree branching factor is 3 and space complexity for height n is O(3n).
- If branching factor is b and height is m for search tree then space complexity of greedy search is O(bm).
You must be logged in to post a comment.
- Option : A
- Explanation :
You must be logged in to post a comment.
You must be logged in to post a comment.
- Option : B
- Explanation : If X then Y is represented by X → Y one more condition is unless Z, it will be included in X, so X then Y unless Z is represented by (X ^ ¬Z) → Y. So, option (B) is correct.
You must be logged in to post a comment.
You must be logged in to post a comment.
- Option : A
- Explanation : F1: P → ¬P = ¬P(¬P) + P¬(¬P) = ¬P + P is satisfiable. F2: (P ⇒ ¬ P) ∨ (¬ P ⇒ P) = (¬P(¬P) + P¬(¬P)) v (P¬(¬P) + ¬P(¬P) ) = satisfiable v satisfiable is satisfiable. So, option (A) is correct.
You must be logged in to post a comment.
You must be logged in to post a comment.
60. Standard planning algorithms assume environment to be __________.
- Option : A
- Explanation : Standard planning algorithms assume environment to be both deterministic and fully observable. So, option (A) is correct.
You must be logged in to post a comment.
You must be logged in to post a comment.
You must be logged in to post a comment.