binary-arithmetic

Consider the 8-bit signed integers $X, Y$ and $Z$ represented using the sign-magnitude form. The binary representations of $X$ and $Y$ are as follows: $$ X: 10110100 \quad Y: 01001...

In a system, numbers are represented using 4-bit two's complement form. Consider four numbers $N 1=1011, N 2=1101, N 3=1010$ and $N 4=1001$ in the system. Which of the following op...

Consider a system that uses 5 bits for representing signed integers in 2’s complement format. In this system, two integers A and B are represented as A =01010 and B =11010. Which o...

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 :

Assuming all numbers are in $$2's$$ complement representation, which of the following numbers is divisible by $$11111011?$$

Booth’s coding in $$8$$ bits for the decimal number –$$57$$ is:

Both’s algorithm for integer multiplication gives worst performance when the multiplier pattern is