Question

For problems 2-4 assume all integers are in binary and in two's complement notation. Remember to...

For problems 2-4 assume all integers are in binary and in two's complement

notation. Remember to indicate overflow if necessary.

2) 0110 1010 + 1001 1110 = ?

3) 1001 1111 + 1001 0001 = ?

4) 1000 1111 + 0001 0000 = ?

0 0
Add a comment Improve this question Transcribed image text
Answer #1
1)
   0110 1010
   1001 1110
-------------
  10000 1000
-------------
There was an overflow of 1
and gives a result of 0000 1000
in decimal it is 8
Answer: 8 with overflow

2)
   1001 1111
   1001 0001
-------------
  10011 0000
-------------
There was an overflow of 1
and gives a result of 0011 0000
0011 0000
=>  0x2^7 + 0x2^6 + 1x2^5 + 1x2^4 + 0x2^3 + 0x2^2 + 0x2^1 + 0x2^0
=>  0x128 + 0x64 + 1x32 + 1x16 + 0x8 + 0x4 + 0x2 + 0x1
=>  0 + 0 + 32 + 16 + 0 + 0 + 0 + 0
=>  48
Answer: 48 with overflow

3)
   1000 1111
   0001 0000
------------
   1001 1111
------------
There is no overflow.
This is different, because it has 1 as left most bit. so, this number is negative.
so, to convert this to decimal, follow these steps below..
--  Flip all the bits(0's to 1, 1's to 0)
    10011111 is flipped to 01100000
--  Add 1 to the above result
    01100000 + 1 = 01100001
--  we can convert above result directly using normal binary to decimal conversion rules.
    01100001
    =>  0x2^7 + 1x2^6 + 1x2^5 + 0x2^4 + 0x2^3 + 0x2^2 + 0x2^1 + 1x2^0
    =>  0x128 + 1x64 + 1x32 + 0x16 + 0x8 + 0x4 + 0x2 + 1x1
    =>  0 + 64 + 32 + 0 + 0 + 0 + 0 + 1
    =>  97
Answer: -97 with out overflow
Add a comment
Know the answer?
Add Answer to:
For problems 2-4 assume all integers are in binary and in two's complement notation. Remember to...
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. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions
  • Please show steps EXERCICE 2 Convert to binary (2's complement) using a compact notation (minimum number...

    Please show steps EXERCICE 2 Convert to binary (2's complement) using a compact notation (minimum number of digits). Number in base 10 Number in base 2 (2's complement) +126.5 -25.8125 1.375 +10.37890625 13.62109375 15.61328125 2.99609375 EXERCICE 3 Give the result of the following set of additions in 8-bit 2's complement. Addends are also in 8-bit 2's complement. Indicate by YES or NO if an overflow occurs. Addition Result Overflow ? 0011 1000 0110 0000 1011 1000 1110 0000 1100 1000...

  • Perform two’s complement addition on the following pairs of numbers. In each case, indicate whether an...

    Perform two’s complement addition on the following pairs of numbers. In each case, indicate whether an overflow has occurred. a. 1001 1101 + 1111 1110 b. 0111 1110 + 0110 0111 c. 1000 0011 + 1000 0010 d. 1010 1000 + 0010 1100

  • `1) How is -9 (base 10) represented in 8-bit two's complement notation? a) 00001001 b)11110111 c)11110110...

    `1) How is -9 (base 10) represented in 8-bit two's complement notation? a) 00001001 b)11110111 c)11110110 d) 11111001 2) The binary addition of 1 + 1 + 1 + 1 = A) 1111(base 2) b) 0001(base2) C) 0100(base2) D) 1001(base2) 3) How is –1 (base 10) represented in 8-bit two's complement notation? A) 1111111- B) 111111111 C) 00000001 D) 00000010

  • binary conversions. please help. thank you! Convert the following Binary number to Base 8 4. 1111...

    binary conversions. please help. thank you! Convert the following Binary number to Base 8 4. 1111 1001 0110 0001 1001 0101 1101 1010 1110 0010 0101 Convert the following Base 8 number to binary 5. 200076524, Convert the following Base 8 number to Base 16 6. 1177662231

  • 2. Convert the following two's complement binary numbers to decimal numbers. These numbers are integers.

    2. Convert the following two's complement binary numbers to decimal numbers. These numbers are integers. a. 110101 b. 01101010 c. 10110101 3. Convert the following decimal numbers to 6-bit two's complement binary numbers and add them. Write the results in 6-bit two's complement binary number format and decimal number format. Indicate whether or not the sum overflows a 6-bit result. a. 14 + 12 b. 30 + 2 C. -7 + 20 d. -18-17 4. What is the signed/magnitude and two's complement range of...

  • Question 12 1 pts What is the decimal for the 2's Complement Binary addition of the...

    Question 12 1 pts What is the decimal for the 2's Complement Binary addition of the following 8 Bit numbers (Assume 8 Bit full adder i.e. overflow is possible) 1000 0001 + 1000 0010 Question 13 1 pts What is the 2's complement binary number for the 2's complement operation of the following 8 bit numbers (Assume 8 Bit full adder i.e. overflow is possible) 0010 1111 - 0011 0000 Question 14 1 pts What is the 2's complement binary...

  • question 1 part 2 and 3 thank you (47) Naruto Notone C Sign In er Sign...

    question 1 part 2 and 3 thank you (47) Naruto Notone C Sign In er Sign Up | Ch ® UFC & MMA × Secure I https://piazza-resourcess3.amazonaws.com/jgopch0cb93d8/j .pdfAWSAccessKeyld-AKAILDNRL/4ALKBWOHA8lexpires-15200435/2&Signature-ol9aXG9 /UAKIHS0QUwMeyBX.. ☆ ミ quations must be properly tyne-set including superscript-s expunents, Always watch the course websile for updates on the assignments. Question 1 (4 points) Show you work I. Convert 2727 into a 32-bit two's complement binary number 2. Convert -5795 into a 16-bit two's complement binary number 3. Add the above...

  • We have learned a famous shift cipher called Caesar Cipher. Now if we are given a...

    We have learned a famous shift cipher called Caesar Cipher. Now if we are given a plain test: THE ART OF WARAnd key = 3 (a shift by 3 letters), please give the ciphertext Given an 8 bit block P = 10101111 and a key K = 01101011, please give the result of bitwise XOR between P and K Please give the left 2 shift of the 8 bit text 01100101 Use the given a permutation table 23614857 to define...

  • Base no bit 0 0 Q-2 (25p): Assume that logical addresses are 16-bit long: 3 bits...

    Base no bit 0 0 Q-2 (25p): Assume that logical addresses are 16-bit long: 3 bits for segment no and 13 bits for offset. Segment table of the currently running process is given below: a) (5) How many segments can this Segment Present Modify Length process have at maximum? bit 0 00100 0111 0000 0100 0000 1000 0100 b) (15) Convert the following logical 10100 0100 0001 0010 0010 1100 1000 address to physical (real) address. 2 01100 0100 0000...

  • Please answer all Questions Fast and Neatly UDP Checksum (20 pts) Suppose a gender that is...

    Please answer all Questions Fast and Neatly UDP Checksum (20 pts) Suppose a gender that is to send a UDP datagram me given below. It is creating the checku. 1110 1101 1111 0110 0100 1010 Checksum 1111 0110 1. Find the binary sum of the other four fields than checksum (8 pts) 2. Wrap around the overflow and add to the least significant bit(s) if any. (2 pts) 3. Find the l's complement of the result of Problem 2. (2...

ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT