Q1➡| Given the truth table of a Binary Operation $ as follows: Identify the matching Boolean Expression.
i ➥ X $ Y’
ii ➥ X’ $ Y
iii ➥ X’ $ Y’
iv ➥ None of the above
Q2➡| If x, y, z are Boolean variable then (x + yÌ…) (x â‹… yÌ… + x â‹… z) (xÌ… â‹… z + yÌ…) is equal to:
i ➥ x.y’
ii ➥ x.y’+z
iii ➥ x.z’
iv ➥ none of the options
Q3➡| What is the radix of the numbers if the solution to the quadratic equation x2 -10x+26=0 is x=4 and x=7?
i ➥ 8
ii ➥ 9
iii ➥ 10
iv ➥ 11
Q4➡| To the detection of up to 5 errors in all cases, the minimum Hamming distance in a block code must be __.
i ➥ 5
ii ➥ 6
iii ➥ 10
iv ➥ 8
Q5➡| Consider a code with only four valid code words: 0000000000, 0000011111, 1111100000, and 1111111111. This code has distance 5. If the code word arrived is 0000000111 then the original code word must be __.
1. (iv)
2. (i)
3. (iv)
4. (ii)
5. (i)
1) D
2) B
3) D
4) B
5) A
1, I
2, ii
3 , IV
4 , ii
5, I
Ans1-iv
Ans2-i
Ans3-iv
Ans4-ii
Ans5-i