Question

In: Computer Science

Find the decimal equivalents for the following 8-bit two’s complement numbers. a. 0010 0100 Decimal Equivalent...

Find the decimal equivalents for the following 8-bit two’s complement numbers.

a. 0010 0100 Decimal Equivalent ___________


b. 1010 1001 Decimal Equivalent ___________


c. 1100 0011 Decimal Equivalent ___________

d. 0101 0101 Decimal Equivalent ___________

Solutions

Expert Solution

Steps to Convert 2's Complement Binary Numbers to Decimal Numbers :

1.Finding the Magnitude of the Number (Positive or Negative) by considering the MSB ( Most Significant Bit) (Left most bit is called MSB

2.If MSB is 0 then the Magnitude of the number is Positive. Then directly convert it into Decimal representation using positional Weight Method.

3. If MSB is 1 then the Magnitude of the Number is Negative. Then follow the below steps

Finding the Decimal Value :

  • Applying 1's complement to the given Number
  • Add 1 to the result
  • And Then convert the final result into decimal representation by using Positional Weight Methods.
  • Apply the Sign (found in Step 1) and to resultant value to get decimal equivalents for the 8-bit two’s complement numbers.

a. 0010 0100

Step1 : The MSB bit is 0 (leftmost bit) . Hence it is a Positive Number.

Step 2: Therefore directly converting it into Decimal using the Positional Weight Method.

Positional Weights 27 26 25 24 23 22 21 20
Bits 0 0 1 0 0 1 0 0
value 0 0 32 0 0 4 0 0

Value = Positional weight x Data Bit (Like 1x 25 = 32 )

Total value = (0 × 27 + 0 × 26 + 1 × 25 + 0 × 24 + 0 × 23 + 1 × 22 + 0 × 21 + 0 × 20)

= 32 + 4 = 36

The  Decimal Equivalent of 0010 0100  is + 36

b. 1010 1001

Step1 : The MSB bit is 1 (leftmost bit) . Hence it is a Negative Number

Step 2: (As the number is Negative We have to use separate method )

2's complement Number (Given) 1 0 1 0 1 0 0 1
1's complement form 0 1 0 1 0 1 1 0
Adding 1 + 1
Final Result 0 1 0 1 0 1 1 1

Converting Final Result into Decimal using the Positional Weight Method.

Positional Weights 27 26 25 24 23 22 21 20
Bits 0 1 0 1 0 1 1 1
value 0 64 0 16 0 4 2 1

Value = Positional weight x Data Bit (Like 1x 25 = 32 )

Total value = (0 × 27 + 1 × 26 + 0 × 25 + 1 × 24 + 0 × 23 + 1 × 22 + 1 × 21 + 1 × 20)

= 64 + 16 + 4 + 2 + 1 = 87

Now apply negative sign to get Final result

The  Decimal Equivalent of  1010 1001 is - 87


c. 1100 0011

Step1 : The MSB bit is 1 (leftmost bit) .Hence it is a Negative Number

Step 2: (As the number is Negative We have to use separate method )

2's complement Number (Given) 1 1 0 0 0 0 1 1
1's complement form 0 0 1 1 1 1 0 0
Adding 1 + 1
Final Result 0 0 1 1 1 1 0 1

Converting Final Result into Decimal using the Positional Weight Method.

Positional Weights 27 26 25 24 23 22 21 20
Bits 0 0 1 1 1 1 0 1
value 0 0 32 16 8 4 0 1

Value = Positional weight x Data Bit (Like 1x 25 = 32 )

Total value = (0 × 27 + 0 × 26 + 1 × 25 + 1 × 24 + 1 × 23 + 1 × 22 + 0 × 21 + 1 × 20)

= 32 + 16 + 8 + 4 + 1 = 61

Now apply negative sign to get Final result

The  Decimal Equivalent of  1100 0011 is - 61

d. 0101 0101

Step1 : The MSB bit is 0 (leftmost bit) . Hence it is a Positive Number.

Step 2: Therefore directly converting it into Decimal using the Positional Weight Method.

Positional Weights 27 26 25 24 23 22 21 20
Bits 0 1 0 1 0 1 0 1
value 0 64 0 16 0 4 0 1

Value = Positional weight x Data Bit (Like 1x 25 = 32 )

Total value = (0 × 27 + 1 × 26 + 0 × 25 + 1 × 24 + 0 × 23 + 1 × 22 + 0 × 21 + 1 × 20)

= 64 + 16 + 4 + 1 = 85

The  Decimal Equivalent of 0101 0101 is + 85

If You Have Any Doubts. Please Ask Using Comments.

Have A Great Day!


Related Solutions

a)The decimal equivalent of the signed 2’s complement 8-bit binary number 11010101B is ______________. b)The decimal...
a)The decimal equivalent of the signed 2’s complement 8-bit binary number 11010101B is ______________. b)The decimal equivalent of the unsigned 8-bit hex number 0B4H is ______________. c)The value of the expression ‘H’ – ‘B’ is less than / equal to / greater than that of the expression ‘L’ – ‘C’. d)If the .data segment contains declarations                         A    BYTE      2 DUP (‘a’), ‘+’ B    BYTE      3 DUP (‘b’), 0 C    BYTE      4 DUP (‘c’), ‘–’ D    BYTE     ...
Please show all work: Determine the 2’s complement equivalent of the following numbers in 8-bit format...
Please show all work: Determine the 2’s complement equivalent of the following numbers in 8-bit format (N.B: You must show your work for full credit)! -12 = -9 =
1. What is the two’s complement of: 00110101 2. Carry out the following calculation using 8-bit...
1. What is the two’s complement of: 00110101 2. Carry out the following calculation using 8-bit signed arithmetic (convert to 8-bit binary sequences) and use two’s complement for the negative number, give the result as both an 8-bit binary sequence and in base 10: 127 – 74. 3. What does shifting a binary sequence to left by 3 places correspond to (from the arithmetic standpoint)
All decimal numbers must be converted to signed two’s complement form before working. Use the least...
All decimal numbers must be converted to signed two’s complement form before working. Use the least number of digits necessary (only using one sign bit) to represent the largest number in a given problem. The smaller number must be represented with the same number of bits. If overflow occurs, indicate that with a note. Show step by step subtraction. 13 - 8 6 - 19 21 - 14
All decimal numbers must be converted to signed two’s complement form before working. Use the least...
All decimal numbers must be converted to signed two’s complement form before working. Use the least number of digits necessary (only using one sign bit) to represent the largest number in a given problem. The smaller number must be represented with the same number of bits. If overflow occurs, indicate that with a note. Show step by step addition. 15 + 6 14 + 18 31 + 5
Convert the following 32-bit IEEE floating point numbers to decimal: 0100 1100 1110 0110 1111 1000...
Convert the following 32-bit IEEE floating point numbers to decimal: 0100 1100 1110 0110 1111 1000 0000 0000 1011 0101 1110 0110 1010 0110 0000 0000 Determine whether or not the following pairs are equivalent by constructing truth tables: [(wx'+y')(w'y+z)] and [(wx'z+y'z)] [(wz'+xy)] and [(wxz'+xy+x'z')] Using DeMorgan’s Law and Boolean algebra, convert the following expressions into simplest form: (a'd)' (w+y')' ((bd)(a + c'))' ((wy'+z)+(xz)')' Draw the circuit that implements each of the following equations: AB'+(C'+AD')+D XY'+WZ+Y' (AD'+BC+C'D)' ((W'X)'+(Y'+Z))'
ASSEMBLY LANGUAGE PROGRAMMING 1. The decimal equivalent of the signed 2’s complement 8-bit binary number 11010101B...
ASSEMBLY LANGUAGE PROGRAMMING 1. The decimal equivalent of the signed 2’s complement 8-bit binary number 11010101B is ______________. 2. The decimal equivalent of the unsigned 8-bit hex number 0B4H is ______________. 3. The value of the expression ‘H’ – ‘B’ is less than / equal to / greater than that of the expression ‘L’ – ‘C’. 4. If the .data segment contains declarations A BYTE 2 DUP (‘a’), ‘+’ B BYTE 3 DUP (‘b’), 0 C BYTE 4 DUP (‘c’),...
Represent the following numbers in binary 8-bit representation using singed magnitude, one's complement, two's complement, and...
Represent the following numbers in binary 8-bit representation using singed magnitude, one's complement, two's complement, and excess-127 representations: a) 48 b) -35
Convert the following binary number (signed 32-bit floating point IEEE-754) into decimal. 0100 0011 0100 0000...
Convert the following binary number (signed 32-bit floating point IEEE-754) into decimal. 0100 0011 0100 0000 0000 0000 0000 0000
Evaluate the following expressions, where two’s complement numbers, A is 11111110 and B is 00000010 and...
Evaluate the following expressions, where two’s complement numbers, A is 11111110 and B is 00000010 and indicate the results. a. A + B b. A – B c. B–A d. –B e. – (-A)
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT