Computer Science Problem: Convert the following 32-bit two's complement binary numbers into decimal numbers: a. 1111 1111 1111 1111 1111 1010 0010 1010two b. 0000 0000 0000 0000 0001 1100 1011 0001two
Computer Science Problem:
Convert the following 32-bit two's complement binary numbers into decimal
numbers:
a. 1111 1111 1111 1111 1111 1010 0010 1010two
b. 0000 0000 0000 0000 0001 1100 1011 0001two
(a)
First bit is nagtive hence we came to know that number is negative
Now , invert all the bits of number i.e. 1111 1111 1111 1111 1111 1010 0010 1010 becomes 0000 0000 0000 0000 0000 0101 1101 0101 , Now add 1 to this new number i.e.
0000 0000 0000 0000 0000 0101 1101 0101
+1
0000 0000 0000 0000 0000 0101 1101 0110
Now we can multiply this number with 2^n starting from back where n>=0
2^0 *0 + 2^1 *1 + 2^2*1 .....
By solving this we get 1494 , as the two complement was having 1 , as first digit , hence -1494 is ans
Trending now
This is a popular solution!
Step by step
Solved in 2 steps
