IMPORTANT SOLVED MODEL TEST PAPER FOR UGC NET DECEMBER 2014
1. The total number of spanning trees that
can be drawn using five labeled vertices is:
(A). 125 (B).64
(C ). 36 (D). 16
Ans : A.
Explanation:
As per Cayleys formula for counting
spanning trees
T(Kn)= n^ (n-2) where n is the number of
vertices.
T(k5)=5 5-2=5 3= 5 * 5 * 5=125
2. Four jobs J1,J2,J3, and J4 are waiting
to be run. Their expected run times are 9,6,3 and 5 respectively. In order to
minimize average response time, the jobs should be run in the order:
(A). J1 J2 J3 J4 (B). J4 J3 J2 J1
(C ) J3 J4 J1 J2 (D) J3 J4 J2 J1
Ans : D
Easy one
J3=3
J4=5
J2=6
J1=9
3. If a code is ‘t’ error detecting, the
minimum hamming distance should be equal to :
(A). t-1 (B). t
(C ). t+1 (D). 2t+1
Ans: C.
Very
often asked question.
Tip:
For
error detection, formula is t+1
For
error correction, formula is 2t+1
