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

 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)

 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

 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.

 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

 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):– !.

 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