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.

91. Which of the following is a knowledge representation technique used to represent knowledge about stereotype situation?
a. Semantic network
b. Frames
c. Scripts
d. Conceptual Dependency
View Answer Report Discuss Too Difficult! Search Google
Answer: (c).Scripts

92. A* algorithm uses f ' = g + h' to estimate the cost of getting from the initial state to the goal state, where g is a measure of the cost of getting from initial state to the current node and the function h' is an estimate of the cost of getting from the current node to the goal state. To find a path involving the fewest number of steps, we should set
a. g = 1
b. g = 0
c. h' = 0
d. h' = 1
View Answer Report Discuss Too Difficult! Search Google
Answer: (a).g = 1

93. Which one of the following prolog programs correctly implement “if G succeeds then execute goal P else execute goal q ?”
a. if-else (G, P, q) :- !, call(G), call(P). if-else (G, P, q) :- call(q).
b. if-else (G, P, q) :- call(G), !, call(P). if-else (G, P, q) :- call(q).
c. if-else (G, P, q) :- call(G), call(P), !. if-else (G, P, q) :- call(q).
d. All of the above
View Answer Report Discuss Too Difficult! Search Google
Answer: (b).if-else (G, P, q) :- call(G), !, call(P). if-else (G, P, q) :- call(q).

94. The strategy used to reduce the number of tree branches and the number of static evaluations applied in case of a game tree is
a. Minmax strategy
b. Alpha-beta pruning strategy
c. Constraint satisfaction strategy
d. Static max strategy
View Answer Report Discuss Too Difficult! Search Google
Answer: (b).Alpha-beta pruning strategy

95. The optimal solution of the following assignment problem using Hungarian method is

codes:
(A)  (B)   (C)   (D)
Hungarian method
a. (I)  (II)    (III)  (IV)
b. (I)  (III)   (II)   (IV)
c. (I)  (III)  (IV)   (II)
d. (I)  (IV)  (II)    (III)
View Answer Report Discuss Too Difficult! Search Google
Answer: (b).(I)  (III)   (II)   (IV)

96. An example of a tautology is:
a. x v y
b. x v (~y)
c. x v (~x)
d. (x=>y)˄(x<=y)
View Answer Report Discuss Too Difficult! Search Google
Answer: (c).x v (~x)

97. The preposition (p→q) ˄ (~q˅p) is equivalent to:
a. q→p
b. p→q
c. (q→p) ˄ (p→q)
d. (p→q) ˅ (q→p)
View Answer Report Discuss Too Difficult! Search Google
Answer: (c).(q→p) ˄ (p→q)

98. If the proposition 7P⇒Q is true, then the truth value of the proposition 7PV(P⇒Q) is:
a. True
b. Multi-Valued
c. False
d. Cannot determined
View Answer Report Discuss Too Difficult! Search Google
Answer: (d).Cannot determined

99. Which of the following checks cannot be carried out on the input data to a system ?
a. Consistency check
b. Syntax check
c. Range check
d. All the above
View Answer Report Discuss Too Difficult! Search Google
Answer: (b).Syntax check

100. A fact in prolog is a special case of a:
a. Query
b. Rule
c. Term
d. Goal
View Answer Report Discuss Too Difficult! Search Google
Answer: (b).Rule

Page 10 of 12