A negative number can be represented in the following 2 forms :
1. Using two's complement
2. Using signed magnitude form
TWO'S COMPLEMENT :
So to represent -16 in two's complement form we follow the following steps
> First we represent 16 as 8-bit binary number : 00010000
> Next we find its one's complement : 11101111
> Then we add 1 to it (to find its two's complement) : 11110000
So, -16 represented using two's complement is 11110000
SIGNED MAGNITUDE :
So to represent -16 in the signed magnitude form we follow the following steps
> First we represent 16 as 8-bit binary number : 00010000
> Next we simply invert the leftmost zero. This will represent the negative sign. : 10010000
So, -16 represented using signed magnitude is 10010000
1. (10 points) Assume 8-bit numbers and express -16 in both forms discussed in class.
13) Name the three forms of isomerism discussed in class. [3 points]
Assume a 16-bit MAR that is organized with 8 bit selector lines for both row and columns. What is the maximum size of the memory unit on this machine? What are the dimensions of the memory, assuming a square 2D organization?
5. Express (76) 10 and (-114)10 in 8-bit binary two's complement arithmetic and then add the numbers. What would be the representation (0)10 in 16-bit binary two's complement? (be sure to show your work). 6. Create two 16-bit 2's complement integer such that their sum causes an overflow. Why does the sum of a negative 2's complement number and a positive 2's complement number never generate an overflow? Discuss.
please help
Problem 4 (10 points): 1. Consider the numbers 23.724 and 0.3344770219. Please normalize both 2. Calculate their sum by hand. 3. Convert to binary assuming each number is stored in a 16-bit register. Half-precision binary floating-point has: sign bit: lbit, exponent width: 5bits and a bias of 15, and significand 10 bits (16 bits total) 4. Show cach step of their binary addition, assuming you have one guard, one round, and one sticky bit, rounding to the nearest...
y7
Assume a 12 bit Hamming code as we discussed in class is used to transmit one byte of data. List the pit positions that parity bits p1, p2. p3 and p4 are formed. Suppose that even parity check is used. What are the bits transmitted for the following ASCII codes?
Add two 16-bit numbers stored in Data 1 and Data 2 using the 8-bit addition instructions. The result is to be stored in Data 3. Do this using add-with-carry to demonstrate the algorithm used for multiple-byte arithmetic.
Calculate the 2's complement of the following 8-bit numbers. Express your final answers in hexadecimal. 1) 101011112 2's Complement: ___________________ 2) 111110102 2's Complement: ___________________
Problem 9 (8 points): Q1 (4 points): Write down the bit pattern in the fraction of value 1/3 assuming a floating point format that uses binary numbers in the fraction. Assume there are 24 bits, and you do not need to normalize. Is this representation exact? 02 (4 points): Write down the bit pattern in the fraction of value 1/3 assuming a floating point format that uses Binary Coded Decimal (base 10) numbers in the fraction instead of base 2....
Express the following numbers in IEEE 32-bit floating-point format: a=-8 b=-7 c=-2.5 d=-1/4
Convert the following numbers to excess-16 floating point “tiny IEEE format”. Assume one bit for sign, 5 for the exponent and 8 for the significant. Add them up and normalize the result. a.) 127 b.) 39