111) Let an, an-1 ,_____ a1, a0 be the binary representation of an integer b. Then b is divisible by 3 if

number of 1's is divisible by 3

number of 0's is divisible by 3

(a) difference of alternate sum, i.e. a0 + a2 +.........- (a1 + a2 + ...) is divisible by 3

Answer is:

(a) difference of alternate sum, i.e. a0 + a2 +.........- (a1 + a2 + ...) is divisible by 3

1010

1001

No such number exists

None of these

Answer is:

1010

101

1000

1001

Answer is:

Conversion to and from the decimal system can be done easily.

It is a 8-4-2-1 weighted code

Both (a) and (b)

Complement of a number can be found efficiently

Answer is:

Answer is: