Bcs303 Discrete Structures Theory of Logic (1) (6 Files Merged) PDF
Bcs303 Discrete Structures Theory of Logic (1) (6 Files Merged) PDF
BTECH BTECH
(SEM III) THEORY EXAMINATION 2023-24 (SEM III) THEORY EXAMINATION 2023-24
DISCRETE STRUCTURES & THEORY OF LOGIC DISCRETE STRUCTURES & THEORY OF LOGIC
TIME: 3HRS M.MARKS: 70 TIME: 3HRS M.MARKS: 70
Note: 1. Attempt all Sections. If require any missing data; then choose suitably. SECTION C
3. Attempt any one part of the following: 7x1=7
SECTION A Q no. Question Marks CO
1. Attempt all questions in brief. 2 x 7 = 14 a. Let R be a binary relation on the set of all strings of 0 and 1 such that R 7 1
Q no. Question Marks C = {(a,b): a and b have same number of 0’s}. Show that whether R is
O
reflexive, symmetric, transitive or a partial order relation.
a. Determine the greatest lower bound and least upper bound of the set {2, 2 1
b. Show that (D42, /) is lattice. Compare the distributive and 7 1
3, 6}, if they exist, in the Poset (D24, /).
complemented lattice with example.
b. Express power set of each of these sets. 2 1
1) {Ø,{ Ø}}
4. Attempt any one part of the following: 7x1=7
2) {a,{a}}
Q no. Question Marks CO
c. Investigate whether the function f(x) = x2 -1 is injective or not for 2 2
f: RR. a. Solve the following Boolean function using K-map: 7 2
d. Express E(x, y, z) = xy+ yꞌz into its complete sum-of-products form. 2 2 F(A,B,C) = (1,2,5,7) and D(0,4,6) using SOP.
b. If f: RR, g : RR and h: RR defined by f(x) = 3x2+2, g(x) =7x-5 7 2
e. Construct inverse of the following statement “If I wake up early 2 3
and h(x) = 1/x. Compute the following composition functions.
in the morning, then I will be healthy.”
(i) (fogoh)(x) (ii) (gog)(x) (iii) (goh)(x)
f. Show that identity element is unique in a group. 2 4
90
90
2
2
13
13
g. Compare Euler circuit and Hamiltonian circuit. 2 5
_2
_2
5. Attempt any one part of the following: 7x1=7
2.
2.
Q no. Question Marks CO
P2
P2
SECTION B
24
24
2. Attempt any three of the following: 7 x 3 = 21 a. Test the validity of the following argument. 7 3
4D
4D
“If there was a ball game, then traveling was difficult. If they arrived on
5.
5.
Q no. Question Marks CO
.5 time, then traveling was not difficult. They arrived on time. Therefore,
.5
P2
P2
a. Construct the Hasse Diagram for (P(S), ⊆) where P(S) is a power 7 1
There was no ball game.”
17
17
set defined on set S={a, b, c}. Determine whether it is a Lattice
Q
Q
b. Describe and Quantifiers with example. “There is someone who got 7 3
or not.
|1
|1
an A in the course” convert this sentence into predicate logic using
b. Solve the following Boolean functions using K-map: 7 2
quantifiers. Prove the following argument. All man are mortal. Socrates
05
05
(i) F(A,B,C,D) = ∑ (m0,m1,m2,m4,m5,m6,m8,m9,m12,m13,m14)
is a man. Therefore, Socrates is mortal.
(ii) F(A,B,C,D) = ∑ (0,2,5,7,8,10,13,15)
2:
2:
c. Show the validity of the following argument: 7 3
:2
:2
6. Attempt any one part of the following: 7x1=7
hypotheses: “It is not sunny this afternoon and it is colder than m
13
13
Q no. Question Marks CO
yesterday. We will go swimming only if it is sunny. If we do not go
swimming, then we will take a canoe trip. If we take a canoe trip, then a. Describe Algebraic structure, semigroup, monoid and group. Also 7 4
4
4
explain the relationship among them.
02
02
we will be home by sunset.
conclusion: “We will be home by sunset.” b. Consider group G = {1, 2, 3, 4, 5, 6} under multiplication modulo 7. 7 4
-2
-2
d. Let G= {1, -1, i, - i} with the binary operation multiplication be 7 4 (a) Construct the multiplication table of G.
03
03
an algebraic structure, where i = √-1 then determine whether G is (b) Compute 2−1, 3−1, 6−1
(c) Compute the orders and subgroups generated by 2 and 3.
9-
9-
an Abelian group. Also if G is cyclic Group, then determine the
(d) Is G cyclic?
|1
|1
generator of G.
e. Explain Pigeon hole principle. Describe generalized form of Pigeon hole 7 5
principle. If 6 colors are to paint 37 homes. Show that at least 7 of them 7. Attempt any one part of the following: 7x1=7
Q no. Question Marks CO
will be of same color.
a. Compare bipartite and complete graph with example. Draw K3,4 and K5. 7 5
Explain why these two graphs are not planar.
b. Show that K3,3 satisfies in equality |E| ≤ 3 |V| – 6, but it is non- 7 5
planar.(V=No. of Vertices, E=No. of Edges, R=No. of Regions)
1|Page 2|Page
QP24DP2_290 | 19-03-2024 13:22:05 | 117.55.242.132 QP24DP2_290 | 19-03-2024 13:22:05 | 117.55.242.132
Printed Pages:03 Sub Code: KCS -303 2. Attempt any three of the following: 10x3=30
Paper Id: 233534 Roll No.
(a) Identify whether the each of the following relations defined on the set X =
{1,2,3,4} are reflexive, symmetric, transitive and/or antisymmetric?
B. TECH.
(SEM-III) THEORY EXAMINATION 2022-23 (i) R1 = { (1,1), (1,2), (2,1) }
DISCRETE STRUCTURES & THEORY OF LOGIC
(ii) R2 = { (1,1), (1,2), (1,4), (2,1), (2,2), (3,3), (4,1), (4,4) }
Time: 3 Hours Total Marks: 100
(iii) R3 = { (2,1), (3,1), (3,2), (4,1), (4,2), (4,3) }
(b) Let a function is defined as f: R-{3}→ R-{1}, f(x) = (x-1)/(x-3) ,
Note: Attempt all Sections. If require any missing data; then choose suitably. then show that f is a bijective function and also compute the inverse of f.
Where R is a set of real numbers.
SECTION A (c) (i) Express Converse, Inverse and Contrapositive of the following statement
“If x+5=8 then x=3”
1. Attempt all questions in brief. 2 x 10 = 20
(ii) Show that the statements P↔Q and (P ⋀ Q) V(⏋P ⋀ ⏋Q) are equivalent
(a) Identify whether ⎾x+y⏋=⎾x⏋+⎾y⏋, ⩝x,y ∈R, where ⎾x⏋is a ceiling (d) Express the following
function (i) Euler graph and Hamiltonian graph
(b) Find the Maximal elements and minimal elements form the following Hasse’s (ii) Chromatic number of a graph
diagram (iii) Walk and path
(iv) Bipartite graph
(e) Solve the following recurrence relation by using generating function.
an + 5an-1 + 6an-2= 42. 4n , where a0 = 1 and a1 = -2
2
90
90
13
13
SECTION C
_2
_2
2.
2.
3. Attempt any one part of the following: 10x1=10
P2
P2
24
24
(a) Let G = {1,-1, 𝑖, 𝑖} with the operation of ordinary multiplication on G be an
algebraic structure, where 𝑖=√-1.
5.
5.
3D
3D
(c) Define what is Big-O notation with respect of growth of functions. .5 (i) Determine whether G is abelian.
.5
P2
P2
(d) Find the composite mapping gof if (ii) Determine the order of each element in G.
17
17
f: RR is given by f(x) = ex and g: RR is given by g(x) = sinx (iii) Determine whether G is a cyclic group, if G is a cyclic group, then
Q
Q
|1
|1
(e) Draw an adjacency matrix for the following graph determine the generator/generators of the group G.
(iv) Determine a subgroup of the group G.
36
36
1:
1:
(b) Let (G,*) and G’,*’) be any two groups and let e and e’ be their respective
:2
:2
identities. If f is a homomorphism of G into G’, then prove that
13
13
(i) f(e) = e’
(ii) f(x-1) = [f(x)]-1 , ⩝ x ∈G
(f) Let A = { Φ, b}, then calculate A P(A), where P(A) is a power set of A.
3
3
02
02
(g) Draw the Hasse’s diagram of the POSET (L, ) , where
4. Attempt any one part of the following: 10x1=10
L = {S0, S1, S2, S3, S4, S5, S6, S7}, where the sets are given by
-2
-2
S0 = {a,b,c,d,e,f}, S1 = {a,b,c,d,e} , S2 = {a,b,c,e,f}, (a) Use generating function to find the number of ways Rs 23 can by paid by using
03
03
S3 = {a,b,c,e}, S4 = {a,b,c} , S5 = {a,b} , S6 = {a,c} , S7 = {a} 4 coins of Rs 5, 6 coins of Rs 2 and 4 coins of Rs 1.
9-
9-
(h) Describe Planar graph and express Euler’s formula for planar graph. (b) Using Pigeonhole principle find the minimum number n of integers to be
selected from S={1,2,3,4,5,6,7,8,9} so that
|2
|2
(i) Define normal subgroup.
(i) the sum of two of the integers is even
(j) Identify whether (p Λ q) → (p V q) is tautology or contradiction with using
(ii) the difference of two of the n integers is 5
Truth table.
BTECH
(SEM III) THEORY EXAMINATION 2021-22
DISCRETE STRUCTURES & THEORY OF LOGIC
(ii) F(A,B,C,D)=∑(0,2,5,7,8,10,13,15)
Time: 3 Hours Total Marks: 100
6. Attempt any one part of the following: 10x1=10
Note: 1. Attempt all Sections. If require any missing data; then choose suitably.
(a) Prove the validity of the following argument. SECTION A
If Mary runs for office, She will be elected. If Mary attends the meeting, she will
run for office. Either Mary will attend the meeting or she will go to India. But Mary 1. Attempt all questions in brief. 2x10 = 20
cannot go to India.
Qno. Question Marks CO
“Thus Mary will be elected”.
(b) Convert the following two statements in quantified expressions of predicate logic a. Let A = {1,2,3,4,5,6} be the set and R = {(1,1) (1,5) (2,2) (2,3) (2,6) (3,2) 2 1
(i) For every number there is a number greater than that number. (3,3,) (3,6) (4,4) (5,1) (5,5) (6,2) (6,3) (6,6)} be the relation defined on set
(ii) Sum of every two integer is an integer. A.
(iii) Not Every man is perfect. Find Equivalence classes induced by R.
(iv) There is no student in the class who knows Spanish and German b. Solve Ackerman Function A (2,1). 2 1
c. State and justify “Every cyclic group is an abelian group”. 2 2
7. Attempt any one part of the following: 10x1=10 d. State Ring and Field with example. 2 2
(a) Prove that the set of residues F={0,1,2,3,4} modulo 5 is a field w.r.t. addition and e. Differentiate complemented lattice and distributed lattice. 2 3
multiplication of residue classes modulo 5. i.e. (F, +5, X5) is a field. f. State De Morgan’s law and Absorption Law. 2 3
(b) Define Boolean algebra. Show that a’.[(b’+c)’+ b.c] + [(a+b’)’.c] = a’.b using
rules of Boolean Algebra. Where a’ is the complement of an element a. g. Translate the conditional statement “If it rains, then I will stay at home” into 2 4
contrapositive, converse and inverse statement.
1
h. State Universal Modus Ponens and Universal Modus Tollens laws. 2 4
13
90
0
i. Explain Euler’s formula. Determine number of regions if a planar graph has 2 5
13
29
30 vertices of degree 3 each.
_2
2.
2.
2_
j. Explain pigeonhole principle with example. 2 5
24
P2
24
SECTION B
2P
5.
5.
3D
.5
2. Attempt any three of the following: 3x10 =30
P2
.5
P2
17
17
Qno. Question Marks CO
Q
Q
|1
a. Justify that for any sets A, B, and C: 10 1
|1
34
36
7:
1:
:2
:2
13
13
2
3
02
02
-2
-2
SECTION C
03
ar
3. Attempt any one part of the following: 1x10 =10
M
9-
1-
|2
a. State Principle of Duality. Let A denote the set of real numbers and a 10 1
|3
relation R is defined on A such that (a,b)R(c,d) if and only if a2 + b2 = c2 +
d2. Justify that R is an equivalence relation.
b. i) Let R = {(1,2) (2,3) (3,1)} defined on A = {1,2,3}. Find the transitive 10 1
closure of R using Warshall’s algorithm.
ii) Justify that “If f: A→B and g: B→C be one-to-one onto functions, then
gof is also one to one onto and (gof)-1= f -1o g -1”.
BTECH
(SEM III) THEORY EXAMINATION 2021-22 B TECH
DISCRETE STRUCTURES & THEORY OF LOGIC (SEM-III) THEORY EXAMINATION 2020-21
DISCRETE STRUCTURE & THEORY OF LOGIC
Time: 3 Hours Total Marks: 100
4. Attempt any one part of the following: 1x10 =10 Note: 1. Attempt all Sections. If require any missing data; then choose suitably.
Qno. Question Marks CO
SECTION A
a. Define the binary operation * on Z by x*y=x + y + 1 for all x,y belongs to 10 2
set of integers. Verify that (Z,*) is abelian group? Discuss the properties of 1. Attempt all questions in brief. 2 x 10 = 20
abelian group. Q no. Question Marks CO
b. i) Justify that “The intersection of any two subgroup of a group (G,*) is 10 2
again a subgroup of (G,*)”. a. Check whether the function f(x) = x2 - 1 is injective or not for f : R→R. 2 CO3
ii) Justify that “If a,b are the arbitrary elements of a group G then (ab)2 = b. Let R be a relation on set A with cardinality n. Write down the number of 2 CO2
a2b2 if and only if G is abelian. reflexive and symmetric relation on set A.
5. Attempt any one part of the following: 1x10 =10 c. Define group. 2 CO3
Qno. Question Marks CO
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
a. Define Modular Lattice. Justify that if ‘a’ and ‘b’ are the elements in a 10 3
b’. Find the Hasse diagram.
bounded distributive lattice and if ‘a’ has complement a′. then
I) a ˅ (a′˄ b)=a˅ b II ) a˄ (a′˅ b)=a˄ b 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
b. i) Justify that (D36,\) is lattice. 10 3 a ≤ b.
P
ii) Let L1 be the lattice defined as D6 and L2 be the lattice (P(S), ≤), where g. Write the negation of the following statement: 2 CO1
0Q
“If I wake up early in the morning, then I will be healthy.”
1
P(S) be the power set defined on set S= {a, b}. Justify that the two lattices
13
13
0
h. Express the following statement in symbolic form: 2 CO1
9
are isomorphic.
29
E2
6. Attempt any one part of the following: 1x10 =10 “All flowers are beautiful.”
2.
2.
i. Define complete and regular graph. 2 CO4
2_
24
24
0
Qno. Question Marks CO
j. Prove that the maximum number of vertices in a binary tree of height h is 2h+1, 2 CO4
P2
2P
a. Use rules of inference to Justify that the three hypotheses (i) “If it does not 10 4
5.
5.
h ≥ 0.
rain or if it is not foggy, then the sailing race will be held and the lifesaving
_Q
.5
.5
P2
demonstration will go on.” (ii) “If the sailing race is held, then the trophy
17
17
TU
Q
will be awarded.” (iii) “The trophy was not awarded.” imply the conclusion SECTION B
|1
|1
(iv) “It rained.”
AK
b. Justify that the following premises are inconsistent. (i) If Nirmala misses 10 4 2. Attempt any three of the following:
34
41
many classes through illness then he fails high school. (ii) If Nirmala fails Q no. Question Marks CO
high school, then he is uneducated. (iii) If Nirmala reads a lot of books then
7:
5:
a. If f : R → R, g : R → R and h : R → R defined by 10 CO3
he is not uneducated. (iv) Nirmala misses many classes through illness and
:2
:5
f(x) = 3x2 +2, g(x) = 7x – 5 and h(x) = 1/x.
reads a lot of books.
13
13
Compute the following composition functions
7. Attempt any one part of the following: 1x10 =10
i. (fogoh)(x)
2
1
Qno. Question Marks CO ii. (gog)(x)
02
02
a. Explain the following terms with example: 10 5 iii. (goh)(x)
-2
-2
i. Graph coloring and chromatic number. iv. (hogof)(x)
ar
ar
ii. How many edges in K7 and K3,3 b. State and prove Lagrange theorem for group. 10 CO3
M
M
iii. Isomorphic Graph and Hamiltonian graph. c. Prove that in any lattice the following distributive inequalities hold 10 CO3
iv. Bipartite graph.
1-
9-
i. a ˄ (b ˅ c) ≥ (a ˄ b) ˅ (a ˄ c)
v. Handshaking theorem.
|3
|1
ii. a ˅ (b ˄ c) ≤ (a ˅ b) ˄ (a ˅ c)
b. i. Justify that “In a undirected graph the total number of odd degree 10 5 d. Prove the validity of the following argument 10 CO1
vertices is even”.
“If I get the job and work hard, then I will get promoted. If I get promoted,
ii. Justify that “The maximum number of edges in a simple graph is
then I will be happy. I will not be happy. Therefore, either I will not get the
n(n-1)/2”.
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.
2|Page 1|Page
QP22P2_290 | 31-Mar-2022 13:27:34 | 117.55.242.131 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
9
2.
iii. A + B(A + B) + A(A΄ + B)
24
iv. XY + (XZ)΄ + XY΄Z(XY + Z)
0
P2
5.
_Q
41
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|Page
AKTU_QP20E290QP | 19-Mar-2021 13:55:41 | 117.55.242.131