# UGC NET Computer Science and Applications Paper III December 2012 - Part 8

71.       You are given four images represented as
The value of entropy is maximum for image
(A) I1                   (B) I2
(C) I3                   (D) I4
Explanation:
Entropy of image represent the randomness pixels.
In I1 all pixel are same. Entropy is zero. In I3 two are same therefore, entropy is maximum whereas in I2 and I4 three3 are same.
72.       A cryptarithmetic problem of the type
SEND
+ MORE
MONEY
Can be solved efficiently using
(A) depth first technique
(C) constraint satisfaction technique
(D) bidirectional technique
73.       Match the following :
List - I
a. Supervised learning
b. Unsupervised learning
c. Reinforcement learning
d. Inductive learning
List - II
1. The decision system receives rewards for its action at the end of a sequence of steps.
2. Manual labels of inputs are not used.
3. Manual labels of inputs are used.
4. System learns by example
Codes :
a   b   c   d
(A) 1   2   3   4
(B) 2   3   1   4
(C) 3   2   4   1
(D) 3   2   1   4
74.       A* algorithm is guaranteed to find an optimal solution if
(A) h' is always 0.
(B) g is always 1.
(C) h' never overestimates h.
(D) h' never underestimates h.
75.       Let θ(x, y, z) be the statement “x+y=z” and let there be two quantifications given as
(i) x y Z θ(x, y, z)
(ii) Z x y θ(x, y, z)
Where x, y, z are real numbers. Then which one of the following is correct?
(A) (i) is true and (ii) is true.
(B) (i) is true and (ii) is false.
(C) (i) is false and (ii) is true.
(D) (i) is false and (ii) is false.