Scribd
Upload
101 views2 pages

Discrete Structure & Theory of Logic KCS303

Uploaded by

Aadarsh Pandey
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
101 views2 pages

Discrete Structure & Theory of Logic KCS303

Uploaded by

Aadarsh Pandey
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Subject Code: KCS303

Roll No:

B TECH
(SEM-III) THEORY EXAMINATION 2020-21
DISCRETE STRUCTURE & THEORY OF LOGIC
Time: 3 Hours Total Marks: 100
Note: 1. Attempt all Sections. If require any missing data; then choose suitably.

SECTION A

1. Attempt all questions in brief. 2 x 10 = 20


Q no. Question Marks CO
a. Check whether the function f(x) = x2 - 1 is injective or not for f : R→R. 2 CO3
b. Let R be a relation on set A with cardinality n. Write down the number of 2 CO2
reflexive and symmetric relation on set A.
c. Define group. 2 CO3
d. Define ring. 2 CO3
e. Let A = {1, 2, 3, 4, 6, 8, 9, 12, 18, 24} be ordered by the relation ‘a divides 2 CO3
b’. Find the Hasse diagram.
f. If L be a lattice, then for every a and b in L prove that a ˄ b = a if and only if 2 CO3
a ≤ b.

i
g. Write the negation of the following statement: ha 2 CO1
“If I wake up early in the morning, then I will be healthy.”
h. Express the following statement in symbolic form: 2 CO1
ad

“All flowers are beautiful.”


i. Define complete and regular graph. 2 CO4
iP

j. Prove that the maximum number of vertices in a binary tree of height h is 2 CO4
2h+1, h ≥ 0.
or

SECTION B
Po

2. Attempt any three of the following:


Q no. Question Marks CO
a. If f : R → R, g : R → R and h : R → R defined by 10 CO3
f(x) = 3x2 +2, g(x) = 7x – 5 and h(x) = 1/x.
Compute the following composition functions
i. (fogoh)(x)
ii. (gog)(x)
iii. (goh)(x)
iv. (hogof)(x)
b. State and prove Lagrange theorem for group. 10 CO3
c. Prove that in any lattice the following distributive inequalities hold 10 CO3
i. a ˄ (b ˅ c) ≥ (a ˄ b) ˅ (a ˄ c)
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.

www.pooripadhai.com
Subject Code: KCS303
Roll No:

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

4. Attempt any one part of the following:


a. A subgroup H of a group G is a normal subgroup if and only if 10 CO3
g- 1hg ϵ H for every h ϵ and g ϵ G.
b. In a group (G, *) prove 10 CO3
that i. (a-1)-1 = a
ii. (ab)-1 = b-1a-1

5. Attempt any one part of the following:

i
a. Simplify the Boolean function ha 10 CO3
F (A, B, C, D) = ∑ (0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 11)
Also draw the logic circuit of simplified F.
ad
b. Simplify the following Boolean expressions using Boolean algebra 10 CO3
i. xy + x΄z +yz
ii. C(B + C)(A + B + C)
iP

iii. A + B(A + B) + A(A΄ + B)


iv. XY + (XZ)΄ + XY΄Z(XY + Z)
or
Po

6. Attempt any one part of the following:


a. Define tautology, contradiction and contingency? Check whether (p ˅ q) ˄ ( 10 CO1
~ p ˅ r) → (q ˅ r) is a tautology, contradiction or contingency.
b. Translate the following statements in symbolic form 10 CO1
i. The sum of two positive integers is always positive.
ii. Everyone is loved by someone.
iii. Some people are not admired by everyone.
iv. If a person is female and is a parent, then this person is someone’s
mother.

7. Attempt any one part of the following:


a. Construct the binary tree whose inorder and preorder traversal is given below. 10 CO4
Also, find the postorder traversal of the tree.
Inorder: d, g, b, e, i, h, j, a, c, f
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

www.pooripadhai.com

You might also like