Gate2019 cs Q18

18Consider Z = X – Y, where X, Y and Z are all in sign-magnitude form. X and Y are each represented in 𝑛 bits. To avoid overflow, the representation of Z would require a minimum of:

Option : C
Explanation :
For example:
Let,

Hence,
Z = 11 which required 5 bits which is (n + 1) bits

Forgot your password?

I agree with the Terms.