AKTU - QP20E290QP: Time: 3 Hours Total Marks: 100
AKTU - QP20E290QP: Time: 3 Hours Total Marks: 100
SECTION A
P
g. Write the negation of the following statement: 0Q 2 CO1
“If I wake up early in the morning, then I will be healthy.”
1
13
h. Express the following statement in symbolic form: 2 CO1
29
2.
0E
24
j. Prove that the maximum number of vertices in a binary tree of height h is 2h+1, 2 CO4
P2
5.
h ≥ 0.
_Q
.5
17
TU
SECTION B
|1
AK
ii. (gog)(x)
02
iii. (goh)(x)
-2
iv. (hogof)(x)
ar
c. Prove that in any lattice the following distributive inequalities hold 10 CO3
9-
i. a ˄ (b ˅ c) ≥ (a ˄ b) ˅ (a ˄ c)
|1
ii. a ˅ (b ˄ c) ≤ (a ˅ b) ˄ (a ˅ c)
d. Prove the validity of the following argument 10 CO1
“If I get the job and work hard, then I will get promoted. If I get promoted,
then I will be happy. I will not be happy. Therefore, either I will not get the
job, or I will not work hard.”
e. If a connected planar graph G has n vertices, e edges and r region, then n – e 10 CO5
+ r = 2.
1 | P a g e
AKTU_QP20E290QP | 19-Mar-2021 13:55:41 | 117.55.242.131
Printed Page: 2 of 2
Subject Code: KCS303
0Roll No: 0 0 0 0 0 0 0 0 0 0 0 0 0
SECTION C
3. Attempt any one part of the following:
a. Prove by mathematical induction for all positive integers that 10 CO2
3.52n+1 + 23n+1 is divisible by 17.
b. Find the numbers between the 100 to1000 that are divisible by 3 or 5 or 7. 10 CO2
1
i. xy + x΄z +yz
13
29
2.
iii. A + B(A + B) + A(A΄ + B)
0E
24
iv. XY + (XZ)΄ + XY΄Z(XY + Z)
P2
5.
_Q
.5
6. Attempt any one part of the following:
17
TU
a. Construct the binary tree whose inorder and preorder traversal is given below. 10 CO4
M
Inorder: d, g, b, e, i, h, j, a, c, f
|1
Preorder: a, b, d, g, e, h, i, j, c, f
b. Solve the following recurrence relation 10 CO3
an – an – 1 + 20an – 2 = 0 where a0 = – 3 , a1 = – 10
2 | P a g e
AKTU_QP20E290QP | 19-Mar-2021 13:55:41 | 117.55.242.131