A computer with a 32 bit word size uses 2’s complement to represent numbers. The range of integers that can be represented by this computer is:
0/30
0
0
Save Progress
Show Timer
Qn #1914
00:00
Qn #1787
Qn #1786
Qn #1784
The least significant bit of the binary number, which is equivalent to any odd decimal number is
Qn #1781
Qn #1780
Qn #1487
Qn #972
Qn #967
Qn #966
Qn #732
Qn #721
Suppose we have a 10-bit computer that uses 10-bit floating point computational unit (Float number uses IEEE floating-point arithmetic where a floating point number has 1 sign bit, 5 exponent bits, and 4 fraction bits). The representation for +∞ (plus infinity) is
Qn #718
Suppose we have a 10-bit computer that uses 10-bit int (2's complement representation). the number representation of - 35 is
Qn #631
Let
the given number 11001, 1001 and 111001 be correspond to the 2’s complement representation.
Then with which one of the following decimal number, the given numbers match
Qn #624
Qn #616
Given
that numbers A and B are two 8 bit 2’s complement numbers with A = 11111111,
B = 11111111. Then sum A + B is _________
Qn #612
Consider
the following 4- bit binary numbers represented in the 2’s complement form :
1101 and 0100 What would be the result when we add them?
Qn #594
Qn #425
Qn #419
Consider a 9-bit representation. Which of the following correctly gives the smallest
number that
can be represented in:
(i) 1's complement,
(ii) 2's complement
Qn #407
Qn #259
Qn #257
Qn #196
Qn #188
Qn #178
Qn #177
Qn #176
Qn #78
Qn #76