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.

81. The tracing model in Prolog describes program execution in terms of certain events. These events are
a. call and exit
b. call and fail
c. call, exit and redo
d. call, exit, redo and fail
View Answer Report Discuss Too Difficult! Search Google
Answer: (d).call, exit, redo and fail

82. Which of the following shall be a compound proposition involving the propositions p, q and r, that is true when exactly two of the p, q and r are true and is false otherwise?
a. (p∨q∧˥r) ∨ (p∨q∧r) ∧ (˥p∧q∨r)
b. (p∧q∨r) ∧ (p∧q∧r) ∨ (˥q∨˥p∧˥r)
c. (p∧q∧˥r) ∨ (p∨˥q∧r) ∨ (˥p∧q∧r)
d. (p∨r∧q) ∨ (p∧q∧r) ∨ (˥p∧q∧r)
View Answer Report Discuss Too Difficult! Search Google
Answer: (c).(p∧q∧˥r) ∨ (p∨˥q∧r) ∨ (˥p∧q∧r)

83. The truth value of the statements:

∃!xP(x)→∃xP(x) and ∃!x˥P(x)→˥∀xP(x), (where the notation ∃!xP(x) denotes the proposition "There exists a unique x such that P(x) is true'') are:
a. True and False
b. False and True
c. False and False
d. True and True
View Answer Report Discuss Too Difficult! Search Google
Answer: (d).True and True

84. Horn clauses are special kinds of propositions which can be described as
a. Single atomic proposition on left side.
b. Single or multiple atomic proposition on left side.
c. A single atomic proposition on left side and a single atomic proposition on right side.
d. A single atomic proposition on left side or an empty left side.
View Answer Report Discuss Too Difficult! Search Google
Answer: (d).A single atomic proposition on left side or an empty left side.

85. Which of the following is/are the fundamental semantic model(s) of parameter passing?
a. in mode
b. out mode
c. in-out mode
d. all of the above
View Answer Report Discuss Too Difficult! Search Google
Answer: (d).all of the above

86. Which one of the following is a correct implementation of the metapredicate “not” in PROLOG (Here G represents a goal) ?
a. not(G):– !, call(G), fail. not(G).
b. not(G):– call(G), !, fail. not(G).
c. not(G):– call(G), fail, !. not(G).
d. not(G):– call(G), fail. not(G):– !.
View Answer Report Discuss Too Difficult! Search Google
Answer: (b).not(G):– call(G), !, fail. not(G).

87. Which one of the following is not an informed search technique?
a. Hill climbing search
b. Best first search
c. A* search
d. Depth first search
View Answer Report Discuss Too Difficult! Search Google
Answer: (d).Depth first search

88. If we convert

∃u ∀v ∀x ∃y (P(f(u),v, x, y) → Q(u,v,y)) to
∀v ∀x (P(f(a),v, x, g(v,x)) → Q(a,v,g(v,x)))

This process is known as
a. Simplification
b. Unification
c. Skolemization
d. Resolution
View Answer Report Discuss Too Difficult! Search Google
Answer: (c).Skolemization

89. Given two jugs of capacities 5 litres and 3 litres with no measuring markers on them. Assume that there is endless supply of water. Then the minimum number of states to measure 4 litres water will be
a. 3
b. 4
c. 5
d. 7
View Answer Report Discuss Too Difficult!
Answer: (d).7

90. The map colouring problem can be solved using which of the following technique?
a. Means-end analysis
b. Constraint satisfaction
c. AO* search
d. Breadth first search
View Answer Report Discuss Too Difficult! Search Google
Answer: (b).Constraint satisfaction