Question

Given two numbers A = 0111 1111 and B = 0111 1111. Add them and find...

Given two numbers A = 0111 1111 and B = 0111 1111. Add them and find the correct option.

a) There is unsigned overflow but no signed overflow.

b) There is signed overflow but not unsigned overflow.

c) There is signed as well as unsigned overflow.

d) There is no overflow.

with explanation.

Homework Answers

Answer #1

Ans

b) There is signed overflow but not unsigned overflow

.

.

In signed numbers first bit is sign bit. Here add results in 11111110 the magnitude gets into sign bit and sets the sign bit . Overflow flag get set. Signed overflow occur when result goes out of 7 bits

.

.

If unsigned numbers are used all bits represent magnitude. so addition does not lead any overflow. The result is a valid unsigned number. No carry flag is set which indicate unsigned overflow. It occurs if result goes out of 8 bits.

.

.

.

If any doubt ask in the comments.

Please appreciate the work by giving a thumbs up.

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
Convert each of following numbers to Hexadecimal numbers, showing all steps. a. (1111 0111)2 b. (1010...
Convert each of following numbers to Hexadecimal numbers, showing all steps. a. (1111 0111)2 b. (1010 1010 1010)2 c. (777) 8 d. (443) 8 e. (998)10 f. (1066)10
Suppose A and B are signed numbers, find the logic expression of the overflow flag when...
Suppose A and B are signed numbers, find the logic expression of the overflow flag when A and B are added. R = result. (Hint: Recall that overflow happens to signed addition if and only if 1) adding two positives and getting a negative, or 2) adding two negatives and getting a positive.) A = a31a30a30…a2a1a0 B = b31b30b30…b2b1b0 R = r31r30r30…r2r1r0
Convert the decimal numbers 40 and 20 into 8-bit unsigned binary representation and add the two...
Convert the decimal numbers 40 and 20 into 8-bit unsigned binary representation and add the two numbers.
Consider the following 12-bit numbers below. Assuming they are unsigned, add them to produce a 12-bit...
Consider the following 12-bit numbers below. Assuming they are unsigned, add them to produce a 12-bit sum the same way a computer would. Also, state whether or not an error results using the same method a computer would. 110010001001 011010001101
(2marks) Consider the following 12-bit numbers below. Assuming they are unsigned, add them to produce a...
(2marks) Consider the following 12-bit numbers below. Assuming they are unsigned, add them to produce a 12-bit sum the same way a computer would. Also, state whether or not an error results using the same method a computer would. 110010001001 011010001101 Repeat the addition and error detection from the previous question, but this time assuming that the numbers are in two’s complement representation. Also: without converting to decimal, but simply by intuition, i.e. looking at the three numbers and applying...
Write a machine language program to input two one-digit numbers, add them, and output the one-digit...
Write a machine language program to input two one-digit numbers, add them, and output the one-digit sum. There can be no space between the two one-digit numbers on input. Write the program in a format suitable for the loader and execute it on the Pep/9 simulator. It needs to be in hexadecimal, I am just confused on how to input numbers on the PEP/9 machine.
Part #1 Sum each of the two unsigned binary numbers: a) 00101011 + 01001001 b) 01111111...
Part #1 Sum each of the two unsigned binary numbers: a) 00101011 + 01001001 b) 01111111 + 00000001 c) 01000100 + 00111100 d) 100000100 + 111 Part #2 Convert the following binary numbers to two's complement: a) 01010101 b) 00000001 c) 00000000 d) 10001111 Part #3 Compute the following multiplications in binary of unsigned integers and show your work: a) 101 * 11 b) 100 * 11110 c) 10001 * 111 d) 10110 * 10110 Part #4 Convert the following...
A set of three numbers {a, b, c} is given. We are allowed to transform it...
A set of three numbers {a, b, c} is given. We are allowed to transform it in the following way: pick any two of them, say a and b, and replace them with two numbers (√ 3 a + b)/2 and (−a + √ 3 b)/2. Is it possible to obtain the triple {2, − √ 3, 1 − √ 3} from the triple {2, √ 3, √ 3/3} by performing a sequence of such operations? Justify your answer.
A and B are two 8-bit 2’s complement numbers. The result of A & B is...
A and B are two 8-bit 2’s complement numbers. The result of A & B is 10011000 and the result of A ^ B is 00100110. (a) What is the sum A + B expressed in 8-bit two’s complement notation (use 1s and 0s, e.g. 10100101)? Will the carry flag be set? Will the overflow flag be set?
ARITHMETIC INSTRUCTIONS a) ADD with register/memory       ADD r [or] ADD M b) ADD immediate.      ...
ARITHMETIC INSTRUCTIONS a) ADD with register/memory       ADD r [or] ADD M b) ADD immediate.       ADI 8 bit data c) ADD with carry       ADC r [or] ADC M 1: Write Assembly Language Program to perform Simple Addition of two 8 Bit Numbers.
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT