 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.

 61. In Propositional Logic, given P and P→Q, we can infer ................. a. ~Q b. Q c. P∧Q d. ~P∧Q

 62. Reasoning strategies used in expert systems include ............... a. Forward chaining, backward chaining and problem reduction b. Forward chaining, backward chaining and boundary mutation c. Forward chaining, backward chaining and back propagation d. Backward chaining, problem reduction and boundary mutation

 63. Language model used in LISP is ................. a. Functional programming b. Logic programming c. Object oriented programming d. All of the above

 64. In constraint satisfaction problem, constraints can be stated as ................... a. Arithmatic equations and inequalities that bind the values of variables b. Arithmatic equations and inequalities that doesn’t bind any restriction over variables c. Arithmatic equations that impose restrictions over variables d. Arithmatic equations that discard constraints over the given variables

 65. Consider the two class classification task that consists of the following points :Class C1: [-1, -1], [-1, 1], [1, -1]Class C2: [1, 1]The decision boundary between the two classes C1 and C2 using single perceptron is given by : a. x1-x2-0.5=0 b. -x1+x2-0.5=0 c. 0.5(x1+x2)-1.5=0 d. x1+x2-0.5=0

 66. Consider a standard additive model consisting of rules of the form ofIf x is Ai AND y is Bi THEN z is Ci.Given crisp inputs x=x0, y=y0, the output of the model is : a. A b. B c. C d. D

 67. How many different truth tables of the compound propositions are there that involve the propositions p & q ? a. 2 b. 4 c. 8 d. 16
 70. The initial basic feasible solution of the following transportion problem is given. Then the minimum cost is a. 76 b. 78 c. 80 d. 82