Q1 Marks 5+5=10
(a) Convert the binary number 11000110 to Gray code
(b) Convert The Gray code 10101111 to binary
Q2 Fill the empty columns in the table by performing each operation against each row. Marks 10
|
A |
B |
C |
D |
AND |
OR |
NAND |
NOR |
|
0 |
0 |
0 |
0 |
||||
|
0 |
0 |
0 |
1 |
||||
|
0 |
0 |
1 |
0 |
||||
|
0 |
0 |
1 |
1 |
||||
|
0 |
1 |
0 |
0 |
||||
|
0 |
1 |
0 |
1 |
||||
|
0 |
1 |
1 |
0 |
||||
|
0 |
1 |
1 |
1 |
||||
|
1 |
0 |
0 |
0 |
||||
|
1 |
0 |
0 |
1 |
||||
|
1 |
0 |
1 |
0 |
||||
|
1 |
0 |
1 |
1 |
||||
|
1 |
1 |
0 |
0 |
||||
|
1 |
1 |
0 |
1 |
||||
|
1 |
1 |
1 |
0 |
||||
|
1 |
1 |
1 |
1 |
/****************** Assignment No. 1 : Solution **********************\
Q1 (a) Binary to Gray
1 1 0 0 0 1 1 0
Step 1: Write left most bit as it is
1
Step 2: Add the left most binary digit to adjacent one
1 + 0 0 0 1 1 0
1 0
Step 3: Add next adjacent pair
1 1 + 0 0 0 1 1 0
1 0 1
Step 4: Again add next adjacent pair and repeat until the last pair
1 1 0 + 0 0 1 1 0
1 0 1 0
Step 5: Repeat step 4
1 1 0 0 + 0 1 1 0
1 0 1 0 0
Step 6: Repeat step 4
1 1 0 0 0 + 1 1 0
1 0 1 0 0 1
Step 7: Repeat step 4
1 1 0 0 0 1 + 1 0
1 0 1 0 0 1 0
Step 8: Repeat step 4
1 1 0 0 0 1 1 + 0
1 0 1 0 0 1 0 1
So the Gray code for the binary 11000110 is 10100101
(b) Gray to Binary
Step 1: Write left most bit as it is
1 0 1 0 1 1 1 1
Gray Code 1
Step 2: Add this gray bit to next binary bit and write the result below as arrows indicate.
1 0 1 0 1 1 1 1
1 1
Step 3: Repeat step 2 until the last bit
1 0 1 0 1 1 1 1
1 1 0
1 0 1 0 1 1 1 1
1 1 0 0
1 0 1 0 1 1 1 1
1 1 0 0 1
1 0 1 0 1 1 1 1
1 1 0 0 1 0
1 0 1 0 1 1 1 1
1 1 0 0 1 0 1
1 0 1 0 1 1 1 1
1 1 0 0 1 0 1 0
So Binary code for the gray 10101111 is 11001010
Q2 Fill the empty columns in the table by performing each operation against each row.
|
A |
B |
C |
D |
AND |
OR |
NAND |
NOR |
|
0 |
0 |
0 |
0 |
0 |
0 |
1 |
1 |
|
0 |
0 |
0 |
1 |
0 |
1 |
1 |
0 |
|
0 |
0 |
1 |
0 |
0 |
1 |
1 |
0 |
|
0 |
0 |
1 |
1 |
0 |
1 |
1 |
0 |
|
0 |
1 |
0 |
0 |
0 |
1 |
1 |
0 |
|
0 |
1 |
0 |
1 |
0 |
1 |
1 |
0 |
|
0 |
1 |
1 |
0 |
0 |
1 |
1 |
0 |
|
0 |
1 |
1 |
1 |
0 |
1 |
1 |
0 |
|
1 |
0 |
0 |
0 |
0 |
1 |
1 |
0 |
|
1 |
0 |
0 |
1 |
0 |
1 |
1 |
0 |
|
1 |
0 |
1 |
0 |
0 |
1 |
1 |
0 |
|
1 |
0 |
1 |
1 |
0 |
1 |
1 |
0 |
|
1 |
1 |
0 |
0 |
0 |
1 |
1 |
0 |
|
1 |
1 |
0 |
1 |
0 |
1 |
1 |
0 |
|
1 |
1 |
1 |
0 |
0 |
1 |
1 |
0 |
|
1 |
1 |
1 |
1 |
1 |
1 |
0 |
0 |
/****************** DOWNLOAD SOLUTION FROM HERE **********************\