1. The decimal equivalent
of the binary number 101011.101 is
Ans: 43.625
2. The binary equivalent
of the decimal number 535 is
a.
1000010111
b.
101011101
c.
010100110101
d.
1110100001
3. The octal equivalent
of the binary number 10011.00101 is
a.
43.12
b.
23.12
c.
46.05
d.
None of these
4. The hexadecimal
equivalent of 11010011001010100
a.
1A654
b.
C32A0
c.
8A654
d.
None of the above
5. The
maximum unsigned binary number that can be represented in 12bits is
Ans: 4095
6. Which of the following
are true for n-bit signed number representation?
a. The minimum and
maximum number that can be represented in sign magnitude is – (2n−1 - 1) and + (2n−1 - 1)
b. The minimum and
maximum number that can be represented in one’s complement is – 2n−1and + ( 2n−1 - 1)
c. The minimum and
maximum number that can be represented in two’s complement is –2n−1and + (2n−1 - 1)
d.
None of the above
7. In 2’s complement
representation -6 is 1010 in 4 bits. The representation of -6 in 8-bit will be:
a.
00001010
b.
10000110
c.
11111010
d.
None of these
8. Which of the following
statements are false?
a.
In 1’s and 2’s complement representations, subtraction can be performed using
addition only.
b.
Subtraction in 1’s complement is more efficient than in 2’s complement.
c.
In 2’s complement subtraction, an optional correction step may be required.
d.
None of these.
9. The BCD equivalent of
the decimal number 25.3 is
a.
00100101.0011
b.
10101.11
c.
100101.11
d.
100101.0011
10. The Gray code equivalent
of the binary number 11001011 is
Ans: 10101110
11. For 8 information
bits, what is the minimum number of parity bits that must be added in Hamming
code for single error correction?
Ans: 4
12. The distance between
the two code words 10101010 and 01011010 is …………
Ans: 4
0 comments:
Post a Comment