Complements (Binary)

Let A = 11111010 and B = 00001010 be two 8 bit 2’s complement numbers. Their product in 2’s complement is

The addition of 4 bit, 2’s complement binary numbers 1101 and 0100 results in

A computer with a 32 bit word size uses 2’s complement to represent numbers. The range of integers that can be represented by this computer is:

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

What is the 8 bit 2's complement representation of the negative integer-93?

What is the 2's complement of 0011 0101 1001 1100?

The 2's complement representation of the number (–100)₁₀ in an 8 bit computer is

If N is a 16-bit signed integer, then 2's complement representation of N is (F87B)₁₆. The 2's complement representation of 8*N is

What is a potential problem of 1’s complement representation of numbers?

Suppose we have a 10-bit computer that uses 10-bit int (2's complement representation). the number representation of - 35 is

The maximum and minimum value represented in signed 16-bit 2s compliment representation are

Let the given number 11001, 1001 and 111001 be correspond to the 2’s complement representation. Then with which one of the following decimal number, the given numbers match

Given that numbers A and B are two 8 bit 2’s complement numbers with A = 11111111, B = 11111111. Then sum A + B is _________

Consider the following 4- bit binary numbers represented in the 2’s complement form : 1101 and 0100 What would be the result when we add them?

Consider a 9-bit representation. Which of the following correctly gives the smallest number that can be represented in: 

In 8-bit two's complement arithmetic, compute the result of the following addition: A = 10011001, B = 11010111. What is the resulting 8-bit binary value?

1’s complement of 1011

1s complement of 1001