Question

Consider the number below, which is stored inside a computer which uses 16-bit 2’s complement base...

Consider the number below, which is stored inside a computer which uses 16-bit 2’s complement base 2 representation. 1101011001110101

(a) Is this number negative? Why, or why not?

(b) Show the resulting value (“bit pattern”) after apply the 2’s complement negation operation to the given value. Is the resulting 2’s complement value (“bit pattern”) a negative number? Explain your answer.

Homework Answers

Answer #1

(a) The given number 1101011001110101 is a negetive number. The leftmost bit in a binary number denotes the sign bit. If it is 1 the no. is negetive otherwise positive.

(b) To find the 2's complement of the given no. 1101011001110101 , we need to first find it's 1's complement.

  • One's complement of 1101011001110101 = 0010100110001010
  • Two's complement of  0010100110001011 = adding 1 to 1's complement obtained above.

=  0010100110001010 + 1 = 0010100110001011

Therefore 2's compliment =  0010100110001011 is a positive number since it's leftmost bit is 0.

Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
Consider decimal number 1027. This value is stored as a 16-bit two's complement number into addresses...
Consider decimal number 1027. This value is stored as a 16-bit two's complement number into addresses 124 and 125 on a little endian machine which has an addressable cell size of one byte. What values (in hexadecimal) are in each of these addresses: 124:   125:
Suppose a computer uses 4-bit one’s complement representation. Ignoring overflows, what value will be stored in...
Suppose a computer uses 4-bit one’s complement representation. Ignoring overflows, what value will be stored in the variable j after the following pseudo code routine terminates? (show details of all steps of the execution) 0 → j // store o in j -3 → k // store -3 in k while k ≠ 0 j = j + 1 k = k – 1 end while
Assume a computer is using signed magnitude base 2 representation to store 8-bit values. Further, assume...
Assume a computer is using signed magnitude base 2 representation to store 8-bit values. Further, assume you have a program which can display the contents of 1-byte memory locations. However, the program displays hex (as a shorthand) instead of binary. What decimal values are represented by the following: (a) C3 (b) 6E Repeat the above, but assume the numbers are stored as 8-bit 2’s complement base 2.
Assuming nine-bit 2’s complement representation, convert the decimal number -137 to binary, show the effect of...
Assuming nine-bit 2’s complement representation, convert the decimal number -137 to binary, show the effect of the ROL operation on it with initial carry C=1, show the status bits and then convert the result back to decimal. Repeat with the ASR operation. Write the RTL specification of both operations shown here.
What will be the output when the computer performs arithmetic left shift operation on the bit...
What will be the output when the computer performs arithmetic left shift operation on the bit pattern 11010101 which is stored in two’s complement format? Verify that if you multiply the original number in decimal by 2 you get your final answer in decimal. Show your work?
Express the decimal number (-37)10 as an 8-bit 2's complement binary number. Given the two signed...
Express the decimal number (-37)10 as an 8-bit 2's complement binary number. Given the two signed binary numbers (2's comp.) X = -8 and Y = 14, what is their sum? What is the BCD representation of the decimal value (9371)10?
1a) 0xCAFE can be written in decimal (base 10) as: 1b) The decimal number -94 can...
1a) 0xCAFE can be written in decimal (base 10) as: 1b) The decimal number -94 can be expressed (in 8 bits) Using signed magnitude representation as: Using one's complement representation as: Using two's complement representation as: Using excess-M representation (with the appropriate value of M) as: 1c) Using the simple floating point model (1-bit sign, 5-bit biased exponent, and 8-bit significand), the number -0.125 (decimal) can be expressed as: (Do not use spaces or any English text. Provide only the...
2. On the Arduino Uno (and other ATMega based boards) an “int” stores a 16-bit (2-byte)...
2. On the Arduino Uno (and other ATMega based boards) an “int” stores a 16-bit (2-byte) value. “int” store negative numbers with a technique called 2's complement math. The highest bit, sometimes referred to as the "sign" bit, flags the number as a negative number. The rest of the bits are inverted and 1 is added. The Arduino takes care of dealing with negative numbers for you, so that arithmetic operations work transparently in the expected manner. a-What is the...
4)What will be the output when the computer performs arithmetic left shift operation on the bit...
4)What will be the output when the computer performs arithmetic left shift operation on the bit pattern11010101 which is stored in two’s complement format?Verify that if you multiply the original number in decimal by 2 you get your final answer in decimal. Show your work?
Convert (96)10 to binary form in 2's complement representation. Given the two binary numbers X =...
Convert (96)10 to binary form in 2's complement representation. Given the two binary numbers X = 1010011 and Y = 1010010 perform the subtraction X - Y. Enter your result below: Which bit of a signed binary number represents the sign?
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT