Computer Number System Questions with Solutions

Consider the following statements about the range of numbers in a 9-bit 1's complement and 2's complement system.

What is the result of the binary subtraction 1100 − 1010 using 2’s complement?

How many bits are used to represent a character in ASCII encoding?

The binary code in which bits are arranged in such a way that only one bit changes at a time when a change is made from one number to the next is called______.

Which of the following binary operations would give 101011 as the result? (All numbers in this question are in the binary number system.)

Which of the following binary operations would give 111010 as the result? (All numbers in this question are in binary number system)

Let $x=11111010$ and $y=00001010$ be two 8-bit 2's complement numbers. Their product in 2's complement notation is

${\left(2FA0C\right)}_{16}$ is equivalent to

When two binary numbers are added, an overflow will never occur if

If ${\left(12x\right)}_3={\left(123\right)}_x$, then the value of $x$ is

To change an upper-case letter to the lower-case letter in ASCII, the correct mask and operation should be:

Floating point numbers in a computer are represented using a $10$ -bit mantissa (including a sign bit) and a $7$ -bit exponent (including a sign bit). What is the approximate value of the maximum number which can be represented? Assume that the mantissa is stored in the normalised form, that is, without leading zeroes.

Given $\sqrt{{\left(224\right)}_r}={\left(13\right)}_r$, the value of the radix $r$ is

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

The decimal equivalent of ${\left(0.11\right)}_2$ is:

The decimal equivalent of ${\left(A.C\right)}_{16}$ is:

The hexadecimal equivalent of ${\left(750\right)}_{10}$ is:

The octal equivalent of ${\left(0.375\right)}_{10}$ is:

The binary equivalent of ${\left(6.125\right)}_{10}$ is:

The hexadecimal equivalent of ${\left(0.8125\right)}_{10}$ is: