DLD |Gate-2012| Digital Logic Design
- The truth table
| X | Y | f(X,Y) |
| 0 | 0 | 0 |
| 0 | 1 | 0 |
| 1 | 0 | 1 |
| 1 | 1 | 1 |
represents the Boolean function : [GATE – 2012]
a. X
b. X + Y
c. X ⊕ Y
d. Y
Answer : a)
- The decimal value 0.5 in IEEE single precision floating point representation has : [GATE – 2012]
a. fraction bits of 000…000 and exponent value of 0
b. fraction bits of 000…000 and exponent value of −1
c. fraction bits of 100…000 and exponent value of 0
d. no exact representation
Answer : b)
- The amount of ROM needed to implement a 4 bit multiplier is : [GATE – 2012]
a. 64 bits
b. 128 bits
c. 1 Kbits
d. 2 Kbits
Answer : d)
- What is the minimal form of the karnaugh map shown below? Assume that X denotes a don’t care term : [GATE – 2012]
a. b’d’
b. b’d’ + b’c’
c. b’d’ + ab’c’d
d. b’d’ + b’c’ + c’d’
Answer : b)
DLD |Gate-2012|