GATE IT 2004 | Question: 42

Question

Using a $4-bit$ $2's$ complement arithmetic, which of the following additions will result in an overflow?

1. $1100 + 1100$
2. $0011 + 0111$
3. $1111 + 0111$

• A. i only
• B. ii only
• C. iii only
• D. i and iii only

Comments

Detailed Video Explanation with Multiple Ways to Solve: https://www.youtube.com/live/URrVGFsZunY?t=585

---

Overflow - Complete Lecture - All in One: https://youtu.be/UO8TTFJC9OE

---

Overflow conditions
1. MSB should be same
2. Positive + Positive  =  Negative    or
    Negative + Negative = Positive

---

Watch the Detailed Video Solution by clicking the button below..!

Watch Detailed Video Solution   

Answer 1

Only (ii) is the answer. 

In $2's$ complement arithmetic, overflow happens only when 

1. Sign bit of two input numbers is $0$, and the result has sign bit $1$
2. Sign bit of two input numbers is $1$, and the result has sign bit $0$.

Overflow is important only for signed arithmetic while carry is important only for unsigned arithmetic.

A carry happens when there is a carry to (or borrow from) the most significant bit. Here, (i) and (iii) cause a carry but only (ii) causes overflow. 

http://teaching.idallen.com/dat2343/10f/notes/040_overflow.txt

Comments

Rather than mugging any kind of formula even it is possible to answer this question provided we know to find range in 2's complement. Here range is from -8 to 7.

option a gives : -8

          b gives :10

          c gives : 6

---

so  the correct option is (b)

---

Also note: Adding 2 different signed data → Overflow can never occur

Answer 2

$($ Carry of $n-1^{th}$ $\oplus$ Carry of $n^{th}) = 1$ Then overflow in 2's complement

$\text{Format of a number here}:\color{green} {C_4}\color{red}{C_3}C_2C_1C_0$ 

In above format $C_4$ is $n^{th}$ carry

$(i) \space 1100 +1100 = 1000 $  Here $C_{n-1} = 1 , C_n = 1$  so $C_{n-1}\oplus C_n = 1 \oplus 1 = 0$

$(ii) \space 0011 +0111 = 1010 $  Here $C_{n-1} = 1 , C_n = 0$  so $C_{n-1}\oplus C_n = 1 \oplus 0 = 1$

$(iii) \space 1111 +0111 = 0110 $  Here $C_{n-1} = 1 , C_n = 1$  so $C_{n-1}\oplus C_n = 1 \oplus 1 = 0$

So option $B$ is only right choice

Answer 3

we can also use overflow logic----->
OV(x,y,z) =x'y'z + xyz'
where x is msb bit of operand 1.y is msb bit of operand 2.And z is msb bit of result excluding carry.

Comments

@saurabh

so what when the result is 1 what it means

and when 0 what is signify ? illustrate that

Answer 4

D) (i) and  (iii) only.

Please comment if anyone finds it wrong !

Comments

(iii) will not result in an overflow. Please see the selected answer.

---

No, It is not possible to have overflow when we have two different signed Inputs