info@avatto.com
+91-9920808017
56. If b is the branching factor and m is the maximum depth of the search tree, what is the space complexity of greedy search?
O(b+m)
O(bm)
O(mm)
Your email address will not be published. Required fields are marked *
Report
Name
Email
Website
Save my name, email, and website in this browser for the next time I comment.
Comment
57. Let P, Q, R and S be Propositions. Assume that the equivalences P ⇔ (Q ∨ ¬ Q) and Q ⇔ R hold. Then the truth value of the formula (P ∧ Q) ⇒ ((P ∧ R) ∨ S) is always:
True
False
Same as truth table of Q
Same as truth table of S
58. “If X, then Y unless Z” is represented by which of the following formulae in propositional logic?
(X ∧ Y) → ¬ Z
(X ∧ ¬ Z) → Y
X → (Y ∧ ¬ Z)
Y → (X ∧ ¬ Z)
59. Consider the following two well-formed formulas in prepositional logic. F1 : P ⇒ ¬ P F2 : (P ⇒ ¬ P) ∨ (¬ P ⇒ P) Which of the following statements is correct?
F1 is Satisfiable, F2 is valid
F1 is unsatisfiable, F2 is Satisfiable
F1 is unsatisfiable, F2 is valid
F1 and F2 both are Satisfiable
60. Standard planning algorithms assume environment to be __________.
Both deterministic and fully observable
Neither deterministic nor fully observable
Deterministic but not fully observable
Not deterministic but fully observable
Login with Facebook
Login with Google
Forgot your password?
Lost your password? Please enter your email address. You will receive mail with link to set new password.
Back to login