written 4.9 years ago by |
Discrete Mathematics - Jun 18
Computer Engineering (Semester 3)
Total marks: 80
Total time: 3 Hours
INSTRUCTIONS
(1) Question 1 is compulsory.
(2) Attempt any three from the remaining questions.
(3) Draw neat diagrams wherever necessary.
i) 2,2,2,2,2,2
ii) 1,1,1,1,1,1
f : Z $\Rightarrow$ Z, f(x) = $x^{2} + x + 1$
e(00) = 00000 e(01) = 01110
e(10) = 10101 e(11) = 11011 is a group of code.
How many errors will it detect and correct?
Be a parity check matrix. Determine the group code. $e_{H}:B^{3} \Rightarrow B^{6} $
A1 = {a,b,c,d} A2 = {a,c,e,g,h}
A3 = {a,c,e,g} A4 = {b,d} A5= {f,h}
Determine whether the following is a partition of A or not. Justify your answer.
i) {A1,A2} II) {A3,A4,A5}
i) A = (2,4,12,24)
ii) A = (1,3,5,15,30)
$f:R \Rightarrow R,f(x) = 2x + 3 $
$g:R \Rightarrow R,g(x) = 3x + 4 $
$h:R \Rightarrow R,h(x) = 4x $
Find gof, fog, gofoh