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.

71. The quantification ∃!x P(x) denotes the proposition “There exists a unique x such that P(x) is true”, express the quantification using universal and existential quantifications and logical operators:
a. ∃x P(x) ∨ ∀x∀y ((P(x) ∨ P(y)) → x = y)
b. ∀ x P(x) ∧ ∀x∀y ((P(x) ∨ P(y)) → x = y)
c. ∃x P(x) ∧ ∀x∀y ((P(x) ∧ P(y)) → x = y)
d. ∃x P(x) ∧ ∃x∃y ((P(x) ∨ P(y)) → x = y)
View Answer Report Discuss Too Difficult! Search Google
Answer: (c).∃x P(x) ∧ ∀x∀y ((P(x) ∧ P(y)) → x = y)

72. Which of the following is a correct predicate logic statement for “Every Natural number has one successor” ?
a. ∀x∃y (succ(x, y) ∧ (∃z succ(x, z) ⇒ equal (y, z)))
b. ∀x∃y (succ(x, y) ∨ (∃z succ(x, z) ⇒ equal (y, z)))
c. ∃y∀x (succ(x, y) ∧ (∃z succ(x, z) ⇒ equal (y, z)))
d. ∀x∃y succ (x, y)
View Answer Report Discuss Too Difficult! Search Google
Answer: (a).∀x∃y (succ(x, y) ∧ (∃z succ(x, z) ⇒ equal (y, z)))

73. α – β cutoffs are applied to .............
a. Depth first search
b. Best first search
c. Minimax search
d. Breadth first search
View Answer Report Discuss Too Difficult! Search Google
Answer: (c).Minimax search

74. Assume that each alphabet can have a value between 0 to 9 in a cryptoarithmetic problem 
   CROSS+ROADS
--------------
DANGER
--------------
Which of the following statement is true ?

(i) No two alphabets can have the same numeric value.
(ii) Any two alphabets may have the same numeric value.
(iii) D = 0
(iv) D = 1
a. (i) and (iii)
b. (i) and (iv)
c. (ii) and (iii)
d. (ii) and (iv)
View Answer Report Discuss Too Difficult! Search Google
Answer: (b).(i) and (iv)

75. Which of the following is not a part of an expert system shell ?
a. Knowledge Base
b. Inference Engine
c. Explanation Facility
d. None of the above
View Answer Report Discuss Too Difficult! Search Google
Answer: (a).Knowledge Base

76. The Blocks World Problem in Artificial Intelligence is normally discussed to explain a ..................
a. Search technique
b. Planning system
c. Constraint satisfaction system
d. Knowledge base system
View Answer Report Discuss Too Difficult! Search Google
Answer: (b).Planning system

77. Means-Ends Analysis process centres around the detection of difference between the current state and the goal state. Once such a difference is found, then to reduce the difference one applies ..................
a. a forward search that can reduce the difference
b. a backward search that can reduce the difference
c. a bidirectional search that can reduce the difference
d. an operator that can reduce the difference
View Answer Report Discuss Too Difficult! Search Google
Answer: (d).an operator that can reduce the difference

78. If an artificial variable is present in the ‘basic variable’ of optimal simplex table then the solution is .................
a. Alternative solution
b. Infeasible solution
c. Unbounded solution
d. Degenerate solution
View Answer Report Discuss Too Difficult! Search Google
Answer: (b).Infeasible solution

79. An optimal assignment requires that the minimum number of horizontal and vertical lines that can be drawn to cover all zeros be equal to the number of
a. rows or columns
b. rows + columns
c. rows + columns – 1
d. rows + columns + 1
View Answer Report Discuss Too Difficult! Search Google
Answer: (a).rows or columns

80. Which of the following is the minimum cost for an assignment problem given below ?
minimum cost for an assignment problem
a. A
b. B
c. C
d. D
View Answer Report Discuss Too Difficult! Search Google
Answer: (c).C