UGCNET Computer Science July 2016 Paper II



Ans .

(C) 25


  1. Explanation :

    smily face





Ans .

(C) 16, 4


  1. Explanation :

    smily face





Ans .

(C) Both R1∩R2 and R1UR2 are reflexive.


  1. Explanation :

    A relation R on a set A is called reflexive if and only if < a, a > R for every element a of A
    because R1 and R2 are reflexive relations So Both R1∩R2 and R1UR2 are reflexive.





Ans .

(B) 2/3


  1. Explanation :

    3 cards Black Black Red Red Black Red
    Black Black Red Red wil have same color on both sides
    so favorable cases =2 total cases =3
    answer is 2/3





Ans .

marks to all


  1. Explanation :

    smily face





Ans .

(C) 1 ⊕ 1 ⊕ 0 = 1


  1. Explanation :

    smily face





Ans .

(D) 64


  1. Explanation :





Ans .

(C) F = x’z + xz’


  1. Explanation :

    x'y'z + x'yz + xy'z' + xyz'
    x'z + xz'





Ans .

(A) AB’


  1. Explanation :

    (AB’+AB’C+AC)(A’C’+B’)
    AB' + AB'C
    AB'(1+C)
    AB'





Ans .

(D) Toggle


  1. Explanation :

    smily face





Ans .

(C) 1


  1. Explanation :





Ans .

(A) a function returning a pointer to an array of integers.


  1. Explanation :





Ans .

(B) All member functions of the class granted friendship have unrestricted access to the members of the class granting the friendship.


  1. Explanation :





Ans .

(D) Overrides


  1. Explanation :





Ans .

(A) 2550


  1. Explanation :

    smily face





Ans .

(C) Entity Integrity


  1. Explanation :





Ans .

(B) III and IV only


  1. Explanation :





Ans .

(A) To allow duplicate tuples in the table by filling the primary key column(s) with NULL.


  1. Explanation :





Ans .

(C) II and III only


  1. Explanation :





Ans .

(C) II only


  1. Explanation :





Ans .

(D) 16


  1. Explanation :

    If we remove the root node, then in the left subtree we always maximum value and put it as the root node.
    Here the maximum value in the left subtree is 16 which will be new root node.





Ans .

(B) Stack operations are performed smoothly


  1. Explanation :

    smily face





Ans .

(C) (n-1)/2


  1. Explanation :

    No. of nods(minimum) in strict binary tree n=2n+1
    So maximum height h=(n-1)/2





Ans .

(C) Job Scheduling


  1. Explanation :

    smily face





Ans .

(B) 14


  1. Explanation :

    smily face





Ans .

(C) 400 kbps


  1. Explanation :

    100*4=400 Kbps (no use of time slot data)





Ans .

(C) 45, 9


  1. Explanation :

    apply formula
    no. Of cables= n(n-1)/2 where n = 10
    and no. Of Ports= n-1 where n= 10





Ans .

(D) Host-to-network


  1. Explanation :





Ans .

(C) N(N-1)/2


  1. Explanation :

    NC2 = N(N-1)/2





Ans .

(C) greater than


  1. Explanation :

    Total Internal Reflection across at angle > critical angle.





Ans .

(D) 12


  1. Explanation :

    smily face





Ans .

(C) 76 H


  1. Explanation :

    Here Add 42H with 5+4+3+2+1 in hexadecimal then it becomes 51 H. Add 25 H it becomes 76 H.





Ans .

(D) Loop jamming


  1. Explanation :





Ans .

(B) I only


  1. Explanation :

    Statement I is incorrect because dynamic linking increases loading time and also overall running time.





Ans .

(B) SLR is powerful than LALR.


  1. Explanation :

    LALR is more powerful than SLR.





Ans .

(D) 9, 10


  1. Explanation :

    smily face





Ans .

(C) Yes, P4 P3 P1 P2


  1. Explanation :

    smily face





Ans .

(C) 321


  1. Explanation :

    smily face





Ans .

(C) mkdir PIS PIS/progs PIS/data


  1. Explanation :





Ans .

(B) Round Robin Scheduling


  1. Explanation :





Ans .

(B) 1 - S3/S1


  1. Explanation :





Ans .

(C) Evolutionary Model


  1. Explanation :





Ans .

(B) Risk analysis


  1. Explanation :





Ans .

(A) P + 1


  1. Explanation :





Ans .

(D) Robustness


  1. Explanation :





Ans .

(B) Replay Attack


  1. Explanation :

    Masquerade Attack- Attacker uses take identity (here using identity of customer).
    Replay attack- Old message is sent again by the attacker without any change.





Ans .

(B) Both (a) and (b) are true


  1. Explanation :





Ans .

(C) exploiting instruction level parallelism


  1. Explanation :

    In pipeline processor, every next instruction arrive in very time.





Ans .

(A) (a) is true, (b) is false


  1. Explanation :

    Data scrubling (not scrubling) is the process to remove sensitive data so that original data can't be derived from scrambled data.





Ans .

(D) (a) is false, (b) is true


  1. Explanation :