Represent -60 in binary using 8-bit signed magnitude. Add the following unsigned 8 bit binary numbers...

Represent -60 in binary using 8-bit signed magnitude.

Add the following unsigned 8 bit binary numbers as shown. 01110101 + 00111011

Add the following unsigned 8 bit binary numbers as shown. 01000100 + 10111011

Expert Solution

1)
-60
------
This is negative. so, follow these steps to convert this to various binary formats.
Divide 60 successively by 2 until the quotient is 0
60/2 = 30, remainder is 0
30/2 = 15, remainder is 0
15/2 = 7, remainder is 1
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 111100
Adding 2 zeros on left hand side of this number to make this of length 8
So, 60 in normal binary format is 00111100
sign-magnitude:
-----------------
set 1 as left most bit, since this number is negative.
so, 00111100 becomes 10111100
=====================================
||    sign-magnitude: 10111100    ||
=====================================

2)
Adding 01110101 and 00111011 in binary
    01110101
    00111011
-------------
    10110000
-------------
so, 01110101 + 00111011 is 10110000

3)
Adding 01000100 and 10111011 in binary
    01000100
    10111011
-------------
    11111111
-------------
so, 01000100 + 10111011 is 11111111

venereology answered 2 hours ago

Write -127 as 8 bit signed binary number both using 2'complement and sign/magnitude notation.

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!)...

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...

Interpret these signed 8-bit sequences with each type of signed/unsigned encoding. Remember the bits are arbitrary!...

Interpret these signed 8-bit sequences with each type of signed/unsigned encoding. Remember the bits are arbitrary! They can be interpreted in many different ways. C.1: Complete the following table using decimal (base-10) numbers. The first line is already completed for you bit sequence unsigned sign-magnitude 1s’ complement 2’s complement 00000101 +5 +5 +5 +5 11110001 ? ? ? ? 01010011 ? ? ? ? 10000000 ? ? ? ? 11111111 ? ? ? ?

c) Using the 32-bit binary representation for floating point numbers, represent the number 1011100110011 as a...

c) Using the 32-bit binary representation for floating point numbers, represent the number 1011100110011 as a 32 bit floating point number. i) A digital camera processes the images images in the real-world and stores them in binary form. Using the principles of digital signal processing, practically explain how this phenomenon occurs.

Convert the following statement into the 8-bit unsigned binary ASCII representation: Bob’s laptop receives the frame...

Convert the following statement into the 8-bit unsigned binary ASCII representation: Bob’s laptop receives the frame containing the ARP reply message. First, convert each character into it's ASCII equivalents. Then, convert to a Binary number. For example: Bob's -> 066 111 098 039 115 -> 01000010 01101111 01100010 00100111 01110011 Remember, each Binary number has to be 8-bits.

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!!!!

Represent (in binary and separately) the decimal signed whole numbers 347 and -347 in each of...

Represent (in binary and separately) the decimal signed whole numbers 347 and -347 in each of the following formats: (a) sign-magnitude. (b) 1's complement (c) 2's complement (d) excess-511 For Parts (a), (b) and (c), use the minimum number of bits necessary; for Part (d), use the same number of bits as in Parts (a), (b) and (c). CAUTION: You will earn NO CREDITS if you simply show the final result and not clearly show working (i.e., intermediate steps). (If...

Write a verilog code for 8-bit signed multiplication using Booth algorithm and represent the RTL view...

Write a verilog code for 8-bit signed multiplication using Booth algorithm and represent the RTL view for code

When adding two signed binary numbers , what does it mean when unsigned overflow has occured?...

When adding two signed binary numbers , what does it mean when unsigned overflow has occured? What is the result of subtracting 1000 from 0001? What, if any, overflows would occur?

Question