Digital Signal Processing

Representation of Numbers

Question 1
Marks : +2 | -2
Pass Ratio : 100%
For a twos complement representation, the truncation error is ____________
Always positive
Always negative
Zero
None of the mentioned
Explanation:
For a two’s complement representation, the truncation error is always negative and falls in the range
Question 2
Marks : +2 | -2
Pass Ratio : 100%
What is the 2’s complement of (1100)2?
(0100)2
(0011)2
(0111)2
(1100)2
Explanation:
The ones complement of (1100)2 is (0011)2. Thus the two complement of this number is obtained as (0011)2+(0001)2=(0100)2.
Question 3
Marks : +2 | -2
Pass Ratio : 100%
Which of the following is the correct representation of a floating point number X?
2E
M.2E(1/2<M<1)
2M.2E(1/2<M<1)
None of the mentioned
Explanation:
The binary floating point representation commonly used in practice, consists of a mantissa M, which is the fractional part of the number and falls in the range 1/2<M<1, multiplied by the exponential factor 2E, where the exponent E is either a negative or positive integer. Hence a number X is represented as X= M.2E(1/2<M<1).
Question 4
Marks : +2 | -2
Pass Ratio : 100%
What is the binary equivalent of (-3/8)?
(10011)2
(0011)2
(1100)2
(1101)2
Explanation:
The number (-3/8) is stored in the computer as the 2’s complement of (3/8)
Question 5
Marks : +2 | -2
Pass Ratio : 100%
If 0<E<255, then which of the following statement is true about X?
Fractional number
Infinity
Mixed number
Zero
Explanation:
According to the IEEE 754 standard, for a 32-bit machine, single precision floating point number is represented as X=(-1)s.2E-127(M).
Question 6
Marks : +2 | -2
Pass Ratio : 100%
What is the mantissa and exponent respectively obtained when we add 5 and 3/8 in binary float point representation?
0.101010,011
0.101000,011
0.101011,011
0.101011,101
Explanation:
We can represent the numbers in binary float point as
Question 7
Marks : +2 | -2
Pass Ratio : 50%
What is the smallest floating point number that can be represented using a 32-bit word?
3*10-38
2*10-38
0.2*10-38
0.3*10-38
Explanation:
Let the mantissa be represented by 23 bits plus a sign bit and let the exponent be represented by 7 bits plus a sign bit.
Question 8
Marks : +2 | -2
Pass Ratio : 50%
What is the range of round-off error for a foxed point representation?
[-0.5(2-b+2-bm), 0.5(2-b+2-bm)]
[0, (2-b+2-bm)]
[0, (2-b-2-bm)]
[-0.5(2-b-2-bm), 0.5(2-b-2-bm-bm)]
Explanation:
The round-off error is independent of the type of fixed point representation. The maximum error that can be introduced through rounding is 0.5(2-b+2-bm) and this can be either positive or negative, depending on the value of x. Therefore, the round-off error is symmetric about zero and falls in the range
Question 9
Marks : +2 | -2
Pass Ratio : 100%
If E=255 and M≠0, then which of the following statement is true about X?
Not a number
Infinity
Defined
Zero
Explanation:
According to the IEEE 754 standard, for a 32-bit machine, single precision floating point number is represented as X=(-1)s.2E-127(M).
Question 10
Marks : +2 | -2
Pass Ratio : 100%
If E=0 and M=0, then which of the following statement is true about X?
Not a number
Infinity
Defined
Zero
Explanation:
According to the IEEE 754 standard, for a 32-bit machine, single precision floating point number is represented as X=(-1)s.2E-127(M).