29210 = 1204b

292 = 1 b 3 + 2 b 2 + 0 b 1 + 4 b 0
292 = b 3 + 2b 2 + 4

(1.2)

b 3 + 2b 2 = 288
Clearly b < 10.
By trial we get that b = 6 satisfies the above equation.

A NSWER b = 6

1.3 PART C
P ROBLEM S TATEMENT To convert 1011011011110010 (given in Gray code) to equivalent binary code.
We have the following algorithm to convert Gray code into binary.

A LGORITHM
1. MSB of the binary code is same as the MSB of the given Gray code.
2. i th bit of the Binary code = (i 1)th bit of the Binary Code i th bit of the Gray code.
Hence we have
MSB or 1st bit = 1
2nd bit = 1 0 = 1
3rd bit = 1 1 = 0
...
and continuing so on we get 1101101101011100

A NSWER 1011011011110010 (in Gray code) = 1101101101011100 (in binary code)

1.4 PART D
P ROBLEM S TATEMENT To convert (AB 33)16 to binary and then to Gray code.
We have
A 16 = 1010
B 16 = 1011

(1.3)

316 = 0011
Hence
AB 3316 = 1010 1011 0011 00112
Now to convert the above binary number into Gray code we have the following algorithm.
A LGORITHM
1. MSB of the Gray code is same as the MSB of the given binary number.
2. i th bit of the Gray code = i th bit of the binary code (i 1)th bit of the binary code.
Hence we have
MSB or 1st bit = 1
2nd bit = 0 1 = 1
3rd bit = 1 0 = 1
...
and continuing so on we get 1111111010101010

A NSWER

AB 3316 = 1010101100110011 (in binary) = 1111111010101010 (in Gray code).

2 P ROBLEM 2
P ROBLEM S TATEMENT To draw the timing diagram of the following circuit