Question

In: Computer Science

1a. Convert 67 (base 10) to 8-bit binary using signed magnitude. Show your work. 1b. Convert...

1a. Convert 67 (base 10) to 8-bit binary using signed magnitude. Show your work.

1b. Convert 69 (base 10) to 8-bit binary using one’s complement. Show your work

1c. Convert 70 (base 10) to 8-bit binary using two’s complement. Show your work.

1d. Convert - 67 (base 10) to 8-bit binary using signed magnitude.

1e. Convert - 67 (base 10) to 8-bit binary using ones compliment. Show your work.

1f. Convert - 67 (base 10) to 8-bit binary using 2s compliment. Show your work.

Solutions

Expert Solution

Solution:

1(a)

Given,

=>Number = (67)10

Explanation:

Converting number into signed magnitude binary:

=>Positive numbers are represented in signed magnitude same as unsigned numbers.

=>67 % 2 => quotient = 33, remainder = 1

=>33 % 2 => quotient = 16, remainder = 1

=>16 % 2 => quotient = 8, remainder = 0

=>8 % 2 => quotient = 4, remainder = 0

=>4 % 2 => quotient = 2, remainder = 0

=>2 % 2 => quotient = 1, remainder = 0

=>1 % 2=> quotient = 0, remainder = 1

=>Arranging remainders from bottom to top = 1000011

=>Hence signed magnitude number representation of (67)10 = (1000011)2

=>Hence signed magnitude number representation of (67)10 in 8 bits = (01000011)2

1(b)

Given,

=>Number = (69)10

Explanation:

Converting decimal number into 1's complement form:

=>Positive numbers are represented in 1's complement form same as unsigned numbers.

=>69 % 2 => quotient = 34, remainder = 1

=>34 % 2 => quotient = 17, remainder = 0

=>17 % 2 => quotient = 8, remainder = 1

=>8 % 2 => quotient = 4, remainder = 0

=>4 % 2 => quotient = 2, remainder = 0

=>2 % 2 => quotient = 1, remainder = 0

=>1 % 2 => quotient = 0, remainder = 1

=>Arranging remainders from bottom to top = (1000101)2

=>Hence 1's complement number representation of (69)10 = (1000101)2

=>Hence 1's complement number representation of (69)10 in 8 bits = (01000101)2

1(c)

Given,

=>Number = (70)10

Explanation:

Converting decimal number into 2's complement form:

=>Positive numbers are represented in 2's complement form same as unsigned numbers.

=>70 % 2 => quotient = 35, remainder = 0

=>35 % 2 => quotient = 17, remainder = 1

=>17 % 2 => quotient = 8, remainder = 1

=>8 % 2 => quotient = 4, remainder = 0

=>4 % 2 => quotient = 2, remainder = 0

=>2 % 2 => quotient = 1, remainder = 0

=>1 % 2 => quotient = 0, remainder = 1

=>Arranging remainders from bottom to top = (1000110)2

=>Hence 2's complement number representation of (70)10 =(1000110)2

=>Hence 2's complement number representation of (70)10 in 8 bits = (01000110)2

1(d)

Given,

=>Number = (-67)10

Explanation:

Converting number into signed magnitude binary:

=>In case of negative decimal numbers representation is different

=>MSB of the signed magnitude number represents the sign of the number. If MSB = 1 then negative number otherwise positive number.

=>Remaining bits after MSB bits represents the modulus decimal value.

=>We know that (67)10 from part (a) = (1000011)2

=>Hence (-67)10 in signed magnitude representation = (11000011)2

1(e)

Given,

=>Number = (-67)10

Explanation:

Converting decimal number into 1's complement form:

=>In 1's complement form we flip each bit of the binary number of modulus value of decimal number.

=>We know that (67)10 from part (a) = (01000011)2

=>Hence (-67)10 in 1's complement form = (10111100)2

1(f)

Given,

=>Number = (-67)10

Explanation:

Converting decimal number into 2's complement form:

=>In case of negative numbers representation is different.

=>MSB of 2's complement number represents the sign of number, if MSB = 1 then number is negative otherwise positive.

=>All the bits represents the value of the 2's complement number.

=>We know that (67)10 from part (a) = (01000011)2

=>Hence (-67)10 in 1's complement form = (10111100)2

=>Hence (-67)10 in 2's complement form = (10111100)2 + (00000001)2

=>Hence (-67)10 in 2's complement form = (10111101)2

I have explained each and every part with the help of statements attached to it.


Related Solutions

a) Using Binary Signed Magnitude arithmetic, find the ‘sum’ of 5810 + (-2310). Show your work....
a) Using Binary Signed Magnitude arithmetic, find the ‘sum’ of 5810 + (-2310). Show your work. (use 8 bits) b) Using two’s complement binary arithmetic, find the sum of 45 and -16. Show your work. (use 8 bits)
1a. 569 (base 10)=_________(base 3) SHOW WORK 1b. 357 (base 9)=___________(base 3) SHOW WORK 1c. 10011100...
1a. 569 (base 10)=_________(base 3) SHOW WORK 1b. 357 (base 9)=___________(base 3) SHOW WORK 1c. 10011100 (base 2)=__________(base 10) SHOW WORK
Write -127 as 8 bit signed binary number both using 2'complement and sign/magnitude notation.
Write -127 as 8 bit signed binary number both using 2'complement and sign/magnitude notation.
Convert the following numbers to 32-bit, 2s compliment binary and hexadecimal formats. Show your work in...
Convert the following numbers to 32-bit, 2s compliment binary and hexadecimal formats. Show your work in recursive division form. 899726616 1656906428 -77102817 -251026154
Binary How is 00001001 (base 2) represented in 8-bit two’s complement notation? Convert 0.3828125 to binary...
Binary How is 00001001 (base 2) represented in 8-bit two’s complement notation? Convert 0.3828125 to binary with 4 bits to the right of the binary point. How is 00110100 (base 2) represented in 8-bit one's complement.  
1. Complete the following table using 8-bit representation ((show your work to get credit) Decimal Signed...
1. Complete the following table using 8-bit representation ((show your work to get credit) Decimal Signed Magnitude One’s Complement Two’s Complement 30 -47 0
Complete the following table. All binary numbers are 8-bit signed integers. (Don't forget to show the...
Complete the following table. All binary numbers are 8-bit signed integers. (Don't forget to show the steps of your solution!) Decimal value Sign-magnitude representation Ones' complement representation Two's complement representation -98 10001011 01110101 10100100 Compute the results of the indicated operations in columns 2 and 3, assuming that the binary numbers represent integers in the formats given by column 1. Identify which of the operations, if any, results in an overflow. (Don't forget to show the steps of your solution!)...
Convert hexadecimal BEEF to base 2 and 8 using grouping (No mathematics). Please show all work.
Convert hexadecimal BEEF to base 2 and 8 using grouping (No mathematics). Please show all work.
Convert the following numbers to 8-bit binary and 8-bit hexadecimal: a) 20 b) 78 c) -25...
Convert the following numbers to 8-bit binary and 8-bit hexadecimal: a) 20 b) 78 c) -25 d) -96 Convert the following hexadecimal numbers to binary and decimal assuming two's compliment format: a) 0x56 b) 0x14 c) 0xF8 d) 0xCC MUST DO ALL PROBLEMS AND SHOW ALL WORK!!!!
Convert the base-10 number to Two’s Complement. Show your work. (a) −12 (b) −32 (c) −57...
Convert the base-10 number to Two’s Complement. Show your work. (a) −12 (b) −32 (c) −57 (d) −112 (e) −24 (f) −85
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT