UGC NET COMPUTER SCIENCE SOLVED PAPERS 2014-16 - UGC NET Computer Science Paper 2 JULY 2016

6. Which of the following logic expressions is incorrect?

  • Option : C
  • Explanation :
    We know that x ⊕ y = x`y + xy` So,
    1. 1 ⊕ 0 = 1`0 + 10` = 0 * 0 + 1 * 1 = 0 + 1 = 1
    2. 1 ⊕ 1 ⊕ 1 = (1 ⊕ 1) ⊕ 1 = (1`1 + 11`) ⊕ 1 = (0) ⊕ 1 = 1`0 + 10` = 0 * 0 + 1 * 1 = 0 + 1 = 1
    3. 1 ⊕ 1 ⊕ 0 = 1 ⊕ (1 ⊕ 0 ) = 1 ⊕ ( 1`0 + 10` = 0 * 0 + 1 * 1 = 0 + 1 ) = 1 ⊕ 1 = 1`1 + 11` = 0
    4. 1 ⊕ 1 = 1`1 + 11` = 0
    So, option (C) is correct.
Cancel reply
Cancel reply

7. The IEEE-754 double-precision format to represent floating point numbers, has a length of _____ bits.

  • Option : D
  • Explanation :
    The IEEE-754 double-precision format to represent floating point numbers, has a length of 64 bits. 1 bit for sign, 11 bit for exponent and rest 52 is for fraction. So, option (D) is correct.
Cancel reply
Cancel reply

8. Simplified Boolean equation for the following truth table is: 

xyzF
0000
0011
0100
0111
1001
1010
1101
1110

  • Option : C
  • Explanation :

    So, option (C) is correct.
Cancel reply
Cancel reply

9. The simplified form of a Boolean equation(­­­­­­­­AB­'+AB­'C+AC) (A­'C­'+B­') is :

  • Option : A
  • Explanation :
    (AB` + AB`C + AC) (A`C` + B`) = AB` +AB`C +AB`C = AB` +AB`C = AB`(1 + C) = AB` So, option (A) is correct.
Cancel reply
Cancel reply