Question 11
Consider \(Z = X - Y\), where \(X\), \(Y\) and \(Z\) are all in sign-magnitude form. \(X\) and \(Y\) are each represented in \(n\) bits. To avoid overflow, the representation of \(Z\) would require a minimum of:
Sign in to see the answer
Answers and explanations are free — they just need an account.