Question

In: Computer Science

Using the three-bit exponent field and four-bit significand, what is the bit pattern for the -2.5?...

Using the three-bit exponent field and four-bit significand, what is the bit pattern for the -2.5? (show work)

Solutions

Expert Solution

11000100

Explanation:
-------------
-2.5
Converting 2.5 to binary
   Convert decimal part first, then the fractional part
   > First convert 2 to binary
   Divide 2 successively by 2 until the quotient is 0
      > 2/2 = 1, remainder is 0
      > 1/2 = 0, remainder is 1
   Read remainders from the bottom to top as 10
   So, 2 of decimal is 10 in binary
   > Now, Convert 0.50000000 to binary
      > Multiply 0.50000000 with 2.  Since 1.00000000 is >= 1. then add 1 to result
      > This is equal to 1, so, stop calculating
   0.5 of decimal is .1 in binary
   so, 2.5 in binary is 00000010.1
-2.5 in simple binary => 10.1
so, -2.5 in normal binary is 10.1 => 1.01 * 2^1

8-bit format:
--------------------
sign bit is 1(-ve)
exponent bits are (3+1=4) => 100
   Divide 4 successively by 2 until the quotient is 0
      > 4/2 = 2, remainder is 0
      > 2/2 = 1, remainder is 0
      > 1/2 = 0, remainder is 1
   Read remainders from the bottom to top as 100
   So, 4 of decimal is 100 in binary
frac/significant bits are 0100

so, -2.5 in 8-bit format is 1 100 0100

Related Solutions

Assuming three-bit exponent field and four-bit significand, what is the bit pattern for -8.75
Assuming three-bit exponent field and four-bit significand, what is the bit pattern for -8.75
Assuming three-bit exponent field and four-bit significant, what is the bit pattern for 5.75
Assuming three-bit exponent field and four-bit significant, what is the bit pattern for 5.75
1. Assuming three-bit exponent field and four-bit significand, what is the bit pattern for -8.75?
1. Assuming three-bit exponent field and four-bit significand, what is the bit pattern for -8.75?
(5 pts) Assuming three-bit exponent field and four-bit significand, what is the bit pattern for 11.25(show...
(5 pts) Assuming three-bit exponent field and four-bit significand, what is the bit pattern for 11.25(show work)
Using the parity bit, port b is to flash in a pattern of Odd Numbered LEDs...
Using the parity bit, port b is to flash in a pattern of Odd Numbered LEDs On and Even Numbered LEDS Off for 1 second, and then Odd Numbered LEDs Off and Even Numbered LEDS On for 1 second. This pattern will repeat indefinitely. Please provide the both the assembly code for MPLAB and a flow chart. Note - consider delay calculations and port B initialization have already been completed.
7-bit float to fraction Consider a 7-bit float representation with 3 exponent bits. that k is...
7-bit float to fraction Consider a 7-bit float representation with 3 exponent bits. that k is the number of exponent bits, and the bias is computed as 2k-1-1. For each problem, convert the given float value (provided as a series of bits) into the equivalent base 10 fraction. Simplify each fraction as much as possible. If there is a whole number part and a fractional part, put a space between them. Here are some example values in the correct format:...
6. (5pts) Using four 1-bit full adders only to design a four-bit combinational Excess-3 to BCD...
6. (5pts) Using four 1-bit full adders only to design a four-bit combinational Excess-3 to BCD converter. Show the block diagram and label all inputs and outputs
1.The binary bit pattern 10011. Please give the number for this pattern represent in each of...
1.The binary bit pattern 10011. Please give the number for this pattern represent in each of the following: ones complement integer, twos complement integer, unsigned integer, sign-magnitude integer, and fixed point factional number. (Please note that there will be two bits to the left of the binary points and three bits to the right)
a. Suppose the information content of a packet is the bit pattern 1110101010101111 and an even...
a. Suppose the information content of a packet is the bit pattern 1110101010101111 and an even parity scheme is being used. What would the value of the checksum field (sequence of parity bits) be for the case of a two-dimensional parity scheme? Your answer should be such that a minimum-length checksum field is used. b. With the same bit-pattern and your derived checksum, prove that the 2D scheme will not be able to detect all burst errors?
a. Suppose the information content of a packet is the bit pattern 1110101010101111 and an even...
a. Suppose the information content of a packet is the bit pattern 1110101010101111 and an even parity scheme is being used. What would the value of the checksum field (sequence of parity bits) be for the case of a two-dimensional parity scheme? Your answer should be such that a minimum-length checksum field is used. b. With the same bit-pattern and your derived checksum, prove that the 2D scheme will not be able to detect all burst errors?
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT