REG. NO.

SLOT: C2+TC2+TCC2
SCHOOL OF ADVANCED SCIENCES
DEPARTMENT OF MATHEMATICS
FALL SEMESTER – 2024-2025
Continuous Assessment Test – II

Programme Name & Branch : B.Tech

Course Code & Course Name : BMAT205L and Discrete Mathematics and Graph Theory
Class Number(s) : “Common Slot QP”
Faculty Name(s) : “Common Slot QP”
Date of Examination and Time : 15-10-2024 and 9:30AM -11:00AM
Exam Duration : 90 Minutes Maximum Marks : 50

Q. No. Questions M CO BL

1. For(i) Let e : B 3 → B 7 be an encoding function. Then

B 3 = {000, 010, 011, 001, 100, 101, 110, 111}. The generator matrix G = (I3 |A) is
given as  
1 0 0 1 1 0 1
 
 
G = 0 1 0 1 0 1 1


 
 
0 0 1 0 1 1 1

Then the code words e(w) = wG, where w ∈ B 3 . Therefore, we get

e(000) = [000] × G = [0000000]

e(010) = [010] × G = [0101011]
e(011) = [011] × G = [0111100]
e(001) = [001] × G = [0010011]
e(100) = [100] × G = [1001001]
e(101) = [101] × G = [1011010]
e(110) = [110] × G = [1100110]
e(111) = [111] × G = [1110100]

For(ii). the parity check matrix H = (AT |I4 ) is,

 
1 1 0 1 0 0 0
 
 
1 0 1 0 1 0 0
 
H=



0 1 1 0 0 1 0
 
 
 
1 1 1 0 0 0 1

For (iii), If r is a received word then decode of r is H × rT .So, If r = [1000111]

then H × [1000111]T = [1010] If r = [1100110] then H × [1100110]T = [0000].
Q. No. Questions M CO BL

2.a Call the jobs A,B,C,D. Choose two arrangements: first, which four operators 5 3 3
should do the jobs; second, which machines should be used. The operator
choice can be made in P (7, 4) ways, and the machines in P (8, 4) ways. In each
case, the first member of the sequence is the one allocated to job A, the second
to job B, and so on. There are P (7, 4) × P (8, 4) = 76548765 = 1, 411, 200 ways.

2.b The three consonants can be chosen in C(6, 3) = 20 ways, and the vowels in 5 3 3
C(4, 2) = 6 ways. After the choice is made, the letters can be arranged in 5! =
120 ways. So there are 20 × 6 × 120 = 14, 400 “words.”

3. ak = 5ak−1 − 6ak−2 with initial conditions a0 = 6 and a1 = 30. The generating 10 4 2

function is
∞
X
G(x) = ak xk = a0 + a1 x + a2 x2 + a3 x3 + a4 x4 + · · · + ...
k=0

Now, we take
∞
X ∞
X ∞
X
k k
ak x = 5 ak−1 x − 6 ak−2 xk (1)
k=2 k=2 k=2

∞
X
ak x k = a2 x 2 + a3 x 3 + a4 x 4 + a5 x 5 + . . .
k=2
= a0 x 0 + a1 x 1 + a2 x 2 + a3 x 3 + · · · − a0 x 0 − a1 x 1
= G(x) − a0 x0 − a1 x1
∞
X
ak−1 xk = a1 x2 + a2 x3 + a3 x4 + a4 x5 + . . .
k=2
= x[a0 x0 + a1 x1 + a2 x2 + a3 x3 + . . . ] − a0 x
= xG(x) − a0 x
∞
X
ak−2 xk = a0 x2 + a1 x3 + a2 x4 + a3 x5 + . . .
k=2
= x2 [a0 x0 + a1 x1 + a2 x2 + a3 x3 + . . . ]
= x2 G(x)

substituting the above in the equation (1), we get

G(x) − a0 − a1 x = 5x(G(x) − a0 ) − 6x2 G(x)

6x2 G(x) − 5xG(x) + G(x) = a0 + a1 x − 5xa0
G(x)[6x2 − 5x + 1] = a0 + a1 x − 5xa0
a0 + a1 x − 5xa0
G(x) =
6x2 − 5x + 1
6 + 30x − 5x(6)
G(x) =
6x2 − 5x + 1
6
G(x) = 2 (by partial fraction)
6x − 5x + 1
−12 18
G(x) = +
1 − 2x 1 − 3x
∞
1
an xn , we get
P
According the formula 1−ax
=
n=0
Q. No. Questions M CO BL

3.
∞
X ∞
X
k k
G(x) = (−12)2 x + 18(3)k xk
k=0 k=0
∞
X
= [18(3)k − 12(2k )]xk
k=0

Hence ak = 18(3)k − 12(2k ), k = 0, 1, 2, 3, 4...

4. For (i) 10 4 2

For(ii)
luba,b=LCMa,b (LCM means leat common multiple). Least upper bound(lub)
table
lub 1 2 3 6 12

1 1 2 3 6 12

2 2 2 6 6 12

3 3 6 3 6 12

6 6 6 6 6 12

12 12 12 12 6 12
Q. No. Questions M CO BL

glba,b=GCDa,b (GCD means greast common divisor). Greatest lower

bound(glb) table

glb 1 2 3 6 12

1 1 1 1 1 1

2 1 2 1 1 2

3 1 1 3 3 3

6 1 2 3 6 6

12 1 2 3 6 12
clearly from the above tables, glb and lub exist for every two elements. Hence
It is lattice.

lcm 1 3 5 15

1 1 3 5 15

5. 3 3 3 15 15

5 5 15 5 15

15 15 15 15 15

gcd 1 3 5 15

1 1 1 1 1

3 1 3 1 3

5 1 1 5 5

15 1 3 5 15

(i). From the above tables, Commutative holds.(a + b = b + a, a × b = b × a)

(ii). From the above tables, Associate holds.

(a + (b + c) = (a + b) + c, a × (b × c) = (a × b) × c)

(iii). From the above tables, Distributive holds.

(a + (b × c) = (a + b) × (a + c), a × (b + c) = (a × b) + (a × c))

(iv). From the above tables, Identity holds. (x + 0 = x, x × 1 = x)

(v). From the above tables, complement holds. (x + x′ = 1, x × x′ = 0)

***************