A directory of Objective Type Questions covering all the Computer Science subjects. Here you can access and discuss Multiple choice questions and answers for various compitative exams and interviews.

111. Consider the following two sentences:

(a) The planning graph data structure can be used to give a better heuristic for a planning problem.
(b) Dropping negative effects from every action schema in a planning problem results in a relaxed problem.

Which of the following is correct with respect to the above sentences?
a. Both sentence (a) and sentence (b) are false.
b. Both sentence (a) and sentence (b) are true.
c. Sentence (a) is true but sentence (b) is false.
d. Sentence (a) is false but sentence (b) is true.
View Answer Report Discuss Too Difficult!
Answer: (b).Both sentence (a) and sentence (b) are true.

112. Consider the set of all possible five-card poker hands dealt fairly from a standard deck of fifty-two cards. How many atomic events are there in the joint probability distribution?
a. 2, 598, 960
b. 3, 468, 960
c. 3, 958, 590
d. 2, 645, 590
View Answer Report Discuss Too Difficult!
Answer: (a).2, 598, 960

113. In Artificial Intelligence (AI), which agent deals with happy and unhappy state?
a. Simple reflex agent
b. Model based agent
c. Learning agent
d. Utility based agent
View Answer Report Discuss Too Difficult!
Answer: (d).Utility based agent

114. If b is the branching factor and m is the maximum depth of the search tree, what is the space complexity of greedy search?
a. O(b+m)
b. O(bm)
c. O(b^m)
d. O(m^b)
View Answer Report Discuss Too Difficult!
Answer: (c).O(b^m)

115. 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 :
a. True
b. False
c. Same as truth table of Q
d. Same as truth table of S
View Answer Report Discuss Too Difficult!
Answer: (a).True

116. “If X, then Y unless Z” is represented by which of the following formulae in propositional logic?
a. (X ∧ Y) → ¬ Z
b. (X ∧ ¬ Z) → Y
c. X → (Y ∧ ¬ Z)
d. Y → (X ∧ ¬ Z)
View Answer Report Discuss Too Difficult!
Answer: (b).(X ∧ ¬ Z) → Y

117. 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?
a. F1 is Satisfiable, F2 is valid
b. F1 is unsatisfiable, F2 is Satisfiable
c. F1 is unsatisfiable, F2 is valid
d. F1 and F2 both are Satisfiable
View Answer Report Discuss Too Difficult!
Answer: (a).F1 is Satisfiable, F2 is valid

118. Standard planning algorithms assume environment to be .................
a. Both deterministic and fully observable
b. Neither deterministic nor fully observable
c. Deterministic but not fully observable
d. Not deterministic but fully observable
View Answer Report Discuss Too Difficult!
Answer: (a).Both deterministic and fully observable

Page 12 of 12