# GATE2003-9

3.2k views

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

1. $11100111$

2. $11100100$

3. $11010111$

4. $11011011$

edited

MSB of $2$'s compliment number has a weight of - $2^{(n-1)}$

( Trick: (from reversing sign extension) just skip all leading $1$'s from MSB expect but $1$, and then calculate the value as normal signed binary rep. )

so by calculating, we get the given number is $-5$ in decimal. and options are

1. $-25$
2. $-28$
3. $-41$
4. $-37$

Therefore it is clear that $- 25$ is divisible by $- 5$. so we can say that (A) is correct 😄

edited by
0
can u explain these trick by taking any example

thanku

Each no is in 2's complement so Lets first convert everything into decimal then it would be easy to see what is wrong  or what is right.

1 .you first check if the number is negative or positive by looking at the sign bit.

2. If it is positive, simply convert it to decimal. If it is negative, make it positive by inverting the bits and adding one.

3 . Then, convert the result to decimal. The negative of this number is the value of the original binary.

Interpret 11111011 as a two's complement binary number, and give its decimal equivalent

1. First, note that the number is negative, since it starts with a 1.
2. Change the sign to get the magnitude of the number.

Simply take the 2's complement of the number.(I think you guys know how to do that then its a cake walk)

2's complement of 11111011  is  00000101  and if you convert it in to Decimal it would be -5

similarly do with all options then we get

11100111 as -25

11100100 as -28

11010111 as -41 and

11011011 as -37  Now you know what should be the answer.

Note -Since the original number was negative, the final result is Negative

0
Why are you changing the sign bit while converting the number from 2's complemented form to sign magnitude form?

Ex: 2's complement of 11111011  is  10000101 and not this 00000101.
A

No. Is - 5 and a is -25
–1 vote
This is a pretty confusing one here even the divisor is 2 complemented so it will be option a.

## Related questions

1
8.5k views
The following is a scheme for floating point number representation using 16 bits. Bit Position 15 14 .... 9 8 ...... 0 s e m Sign Exponent Mantissa Let s, e, and m be the numbers represented in binary in the sign, exponent, and mantissa fields respectively. Then the ... maximum difference between two successive real numbers representable in this system? $2^{-40}$ $2^{-9}$ $2^{22}$ $2^{31}$
Consider the ALU shown below. If the operands are in $2’s$ complement representation, which of the following operations can be performed by suitably setting the control lines $K$ and $C_0$ only (+ and – denote addition and subtraction respectively)? $A + B$, and $A – B$, but not $A + 1$ $A + B$, and $A + 1$, but not $A – B$ $A + B$, but not $A – B$ or $A + 1$ $A + B$, and $A – B$, and $A + 1$
The literal count of a Boolean expression is the sum of the number of times each literal appears in the expression. For example, the literal count of $\left(xy+xz'\right)$ is $4.$ What are the minimum possible literal counts of the product-of-sum and sum-of-product representations respectively of the ... following Karnaugh map? Here, $X$ denotes "don't care" $(11, 9)$ $(9, 13)$ $(9, 10)$ $(11,11)$
A $\text{1-input}$, $\text{2-output}$ synchronous sequential circuit behaves as follows: Let $z_k, n_k$ denote the number of $0'$s and $1's$ respectively in initial k bits of the input $(z_k+n_k=k)$. The circuit outputs $00$ until one of the following conditions holds ... is $01$. What is the minimum number of states required in the state transition graph of the above circuit? $5$ $6$ $7$ $8$