0

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:

  1.  n bits
  2. n − 1 bits
  3. n + 1 bits
  4. n + 2 bits
Asked question