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:
- n bits
- n − 1 bits
- n + 1 bits
- n + 2 bits
ask and answer | learn and let learn
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: