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 :

Let $$X$$ be the number of distinct $$16$$-bit integers in $$2’s$$ complement representation. Let $$Y$$ be the number of distinct $$16$$-bit integers in sign magnitude representation.
Then $$X −Y$$ is ____________.

Consider an eight-bit ripple-carry adder for computing the sum of $$A$$ and $$B,$$ where $$A$$ and $$B$$ are integers represented in $$2’s$$ complement form. If the decimal value of $$A$$ is one, the decimal value of $$B$$ that leads to the longest latency for the sum to stabilize is __________ .

The $$16$$-bit $$2’s$$ complement representation of an integer is $$1111$$ $$1111$$ $$1111$$ $$0101;$$ its decimal representation is ____________.