671 (base 10) = ____________ (base 9)
- 825
1101101 (base 2) = ____________ (base 10)
- 109
557 (base 10) = ____________ (base 16)
- 22D
601 (base 10) = ____________ (base 9)
- 737
01D7 (base 16) = ____________ (base 10)
- 471
A value represented using 16 bits will always be more accurate than a value represented using 8 bits.
- False
The binary addition of 1 + 1 + 1 + 1 = __________.
- 0100 (base 2)
A biased floating-point exponent uses some manner of excess-M representation.
- True
Excess-M notation uses unsigned integers to express negative integers.
- True
Only a limited range of real numbers can be expressed using the IEEE 754 standard.
- True
How is -1 (base 10) represented in 8-bit two’s complement notation?
- 11111111
Assuming we are using the Hamming algorithm presented in your text and even parity to design an error-correcting code, find the code word to represent the 8-bit information word 01001000.
- 010011001000
The binary string 01000110001000 is a floating-point number expressed using the 14-bit simple model given in your text. (There are no implied bits.) What is its decimal equivalent?
- 2.125
Convert -52 (base 10) to binary 8-bit one’s complement.
- 11001011
________ is the hexadecimal symbol for 11.
- B
509 (base 10) = ____________ (base 16)
- IFD
1031 (base 5) = ____________ (base 10)
- 141
10022 (base 3) = ____________ (base 10)
- 89
138 (base 10) = ____________ (base 5)
- 1023
Convert 0B2C (base 16) to binary
- 1011 0010 1100
Overflow is indicated when the carry in to the high-order bit is not equal to the carry out.
- True
664 (base 9) = ____________ (base 10)
- 544
ASCII is a 7-bit code, while Unicode is a 16-bit code.
- True
In order to provide greater range for a floating-point number, we make the significand larger.
- False
Convert 0.3828125 to binary with 8 bits to the right of the binary point.
- 0.01100010
122 (base 10) = ____________ (base 2)
- 1111010
424 (base 8) = ____________ (base 10)
- 276
How is -9 (base 10) represented in 8-bit two’s complement notation?
- 11110111
Signed-magnitude and two’s complement both have two representations for zero.
- False
355 (base 10) = ____________ (base 7)
- 1015
If the most significant bit of a signed binary number is 1, that number is:
- negative.
The range of decimal values that can be expressed in 7 bits using binary two’s complement is -32 to 31.
- False
10122 (base 3) = ____________ (base 10)
- 98
379 (base 10) = ____________ (base 7)
- 1051
67 (base 10) = ____________ (base 3)
- 2111
The general idea of Booth’s algorithm is to increase the speed of addition when there are consecutive zeroes or ones in the multiplier.
- False
210 (base 10) = ____________ (base 8)
- 322
247 (base 10) = ____________ (base 8)
- 367
The largest positive unsigned decimal number that can be expressed in 6 bits is 63.
- True
CRCs use systematic error detection.
- True