add the following numbers using 16-bit 2's complement.
show all the steps and calculations.
Please also show steps to verify that the answer is correct.
9288 and -7372

Number: 9288
Let's convert this to two's complement binary
Since this is a positive number. we can directly convert this into
binary
Divide 9288 successively by 2 until the quotient is 0
> 9288/2 = 4644, remainder is 0
> 4644/2 = 2322, remainder is 0
> 2322/2 = 1161, remainder is 0
> 1161/2 = 580, remainder is 1
> 580/2 = 290, remainder is 0
> 290/2 = 145, remainder is 0
> 145/2 = 72, remainder is 1
> 72/2 = 36, remainder is 0
> 36/2 = 18, remainder is 0
> 18/2 = 9, remainder is 0
> 9/2 = 4, remainder is 1
> 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 10010001001000
So, 9288 of decimal is 10010001001000 in binary
Adding 2 zeros on left hand side of this number to make this of
length 16
so, 9288 in 2's complement binary is 0010010001001000
Number: -7372
Let's convert this to two's complement binary
This is negative. so, follow these steps to convert this into a 2's
complement binary
Step 1:
Divide 7372 successively by 2 until the quotient is 0
> 7372/2 = 3686, remainder is 0
> 3686/2 = 1843, remainder is 0
> 1843/2 = 921, remainder is 1
> 921/2 = 460, remainder is 1
> 460/2 = 230, remainder is 0
> 230/2 = 115, remainder is 0
> 115/2 = 57, remainder is 1
> 57/2 = 28, remainder is 1
> 28/2 = 14, remainder is 0
> 14/2 = 7, remainder is 0
> 7/2 = 3, remainder is 1
> 3/2 = 1, remainder is 1
> 1/2 = 0, remainder is 1
Read remainders from the bottom to top as 1110011001100
So, 7372 of decimal is 1110011001100 in binary
Adding 3 zeros on left hand side of this number to make this of
length 16
So, 7372 in normal binary is 0001110011001100
Step 2: flip all the bits. Flip all 0's to 1 and all 1's to
0.
0001110011001100 is flipped to 1110001100110011
Step 3:. Add 1 to above result
1110001100110011 + 1 = 1110001100110100
so, -7372 in 2's complement binary is 1110001100110100
Adding 0010010001001000 and 1110001100110100 in
binary
0010010001001000
1110001100110100
---------------------
(1)0000011101111100
---------------------
Sum produces a carry of 1. We can ignore that carry.
So, sum of these numbers in binary is 0000011101111100
Verification:
---------------
sum = 0000011101111100
since left most bit is 0, this number is positive
so, we can directly convert this into a decimal value
=> 11101111100
=>
1x2^10+1x2^9+1x2^8+0x2^7+1x2^6+1x2^5+1x2^4+1x2^3+1x2^2+0x2^1+0x2^0
=> 1x1024+1x512+1x256+0x128+1x64+1x32+1x16+1x8+1x4+0x2+0x1
=> 1024+512+256+0+64+32+16+8+4+0+0
=> 1916
Answer: 1916
This is correct since we can verify that 9288+-7372 = 1916
So, there was no overflow.
add the following numbers using 16-bit 2's complement. show all the steps and calculations. Please also...
add the following numbers using 32-bit 2's complement. show all the steps and calculations. Please also show steps to verify that the answer is correct. 99288 and -99772
add -2833 and -238993 using 32-bit 2's complement and show all the steps and also verify that the result is true.
Q1) Convert the following negative decimal numbers to 8 bit binary using the 2’s complement (show the steps): a) -39 b) -127 Q2) Solve the following subtraction problems using 2's complement representation. (Show the steps using 8-bits) a) 19 – 87 b) 89 – 5 Q3) Convert the following numbers into scientific notation: (Note: to show ten raised to the power of n, you can type as 10^n) a) 654.345 b) 0.000000324235 c) 25600000000000 Q4) Convert the following numbers out...
Please show steps
EXERCICE 2 Convert to binary (2's complement) using a compact notation (minimum number of digits). Number in base 10 Number in base 2 (2's complement) +126.5 -25.8125 1.375 +10.37890625 13.62109375 15.61328125 2.99609375 EXERCICE 3 Give the result of the following set of additions in 8-bit 2's complement. Addends are also in 8-bit 2's complement. Indicate by YES or NO if an overflow occurs. Addition Result Overflow ? 0011 1000 0110 0000 1011 1000 1110 0000 1100 1000...
Add the following 16-bit hexadecimal numbers to obtain a checksum. Remember to complement your final answer and to submit your answer in hexadecimal with the 0x prefix notation. 0x2191 0x679b 0x928b 0xd0de
Add the following unsigned binary numbers: 01110101 + 00111011 Subtract the following binary numbers using 2's Complement 01110101 - 00111011 SHOW STEPS
Add the numbers from 24 and 25 together using one’s complement. S 64 32 16 8 4 2 1 Convert the binary number 00100100 using one’s complement. S 64 32 16 8 4 2 1 1 1 0 1 1 0 1 1 Convert the binary number 00011110 using one’s complement. S 64 32 16 8 4 2 1 1 1 1 0 0 0 0 1 Add the numbers from 27 and 28 together using one’s complement. S 64...
-write the operands as 4-bit 2's complement binary numbers, -perform the operation shown, -show all work in binary operating on 4-bit numbers, and -identify overflow if necessary. a) 4 + 2 b) 4 – 2 c) 2 – 4 d) 4 + 4
1.7 (2 marks) Add the following numbers in binary using 2’s complement to represent negative numbers. Use a word length of 6 bits (including sign) and indicate if an overflow occurs. Repeat using 1’s complement to represent negative numbers. (b) (−14) + (−32) (e) (−11) + (−21)
Perform the following binary multiplications using 7-bit signed numbers in two's complement format. Convert them to decimal, and verify the correct result of the operation.