UGC NET Previous Year Papers
COMPUTER SCIENCE AND APPLICATIONS
Paper II – June2016 (2882016)
1. The Boolean function [~ (~p ∧ q) ∧ ~(~p ∧~q)] ∨ (p ∧ r) is equal to the Boolean function:
(1) q
(2) p ∧ r
(3) p ∨ q
(4) p
Ans: (4)
2. Let us assume that you construct ordered tree to represent the compound proposition (~ (p∧q)) ↔ (~ p ∨ ~ q).
Then, the prefix expression and postfix expression determined using this ordered tree are given as ____ and _____ respectively.
(1) ↔~∧pq∨ ~ ~ pq, pq∧~p~q~∨↔
(2) ↔~∧pq∨ ~ p~q, pq∧~p~q~∨↔
(3 ↔~∧pq∨ ~ ~ pq, pq∧~p~ ~q∨↔
(4) ↔~∧pq∨ ~ p~ q, pq∧~p~ ~q∨↔
Ans: (2)
3. Let A and B be sets in a finite universal set U. Given the following :
A – B, A ⊕ B, A + B and A ∪ B
Which of the following is in order of increasing size ?
(1) A – B < A ⊕ B < A + B < A ∪ B
(2) A ⊕ B < A – B < A ∪ B < A + B
(3) A ⊕ B < A + B < A – B < A ∪ B
(4) A – B < A ⊕ B < A ∪ B < A + B
Ans: (4)
4. What is the probability that a randomly selected bit string of length 10 is a palindrome?
(1)
(2)
(3)
(4)
Ans: (2)
5. Given the following graphs :
Which of the following is correct ?
(1) G_{1} contains Euler circuit and G_{2} does not contain Euler circuit.
(2) G_{1} does not contain Euler circuit and G_{2} contains Euler circuit.
(3) Both G_{1} and G_{2} do not contain Euler circuit.
(4) Both G_{1 }and G_{2} contain Euler circuit.
Ans: (3)
6. The octal number 326.4 is equivalent to
(1) (214.2)_{10 }and (D6.8)_{16}
(2) (212.5)_{10} and (D6.8)_{16}
(3) (214.5)_{10} and (D6.8)_{16}
(4) (214.5)_{10 }and (D6.4)_{16}
Ans: (3)
7. Which of the following is the most efficient to perform arithmetic operations on the numbers?
(1) Signmagnitude
(2) 1’s complement
(3) 2’s complement
(4) 9’s complement
Ans: (3)
8. The Karnaugh map for a Boolean function is given as
The simplified Boolean equation for the above Karnaugh Map is
(1) AB + CD +AB̅ + AD
(2) AB + AC + AD + BCD
(3) AB + AD + BC + ACD
(4) AB + AC + BC + BCD
Ans: (2)
9. Which of the following logic operations is performed by the following given combinational circuit ?
(1) EXCLUSIVEOR
(2) EXCLUSIVENOR
(3) NAND
(4) NOR
Ans: (1)
10. Match the following :
List – I 
List – II 
a. Controlled Inverter b. Full adder c. Half adder d. Binary adder

i. a circuit that can add 3 bits ii. a circuit that can add two binary numbers iii. a circuit that transmits a binary word or its 1’s complement iv. a logic circuit that adds 2 bits 
Codes :
a b c d
(1) iii ii iv i
(2) ii iv i iii
(3) iii iv i ii
(4) iii i iv ii
Ans: (4)