Tetal No. of Page -3 Roll No.

SecondSemester Bock (CSE

EndTerm Examination May-2024
CS102: DISCRETE STRUCTURES
Time: 3:00 Hours Mox. Matks: 50
Note: Anser any fiv qwstions, All questions corry eqal marks. Assme xnitahle
missing data. if any:

W Test the validity of the tollowing argument relating to the students of lO|
Department of Computer Scienee and Engineering (CSE) using Rules of
Interence:
i) Astudent of the CSE will graduate this semester only i' the student has
passed the subject programming fundanentals.
(i) If Raju does not study the subject programming fundanentals for l0
hours aweck, then he will notpass in programming fundanmentals.
(i) lf students study programming fundamentals for 10 hours a weck, then
they cannot play volleyball.
Therefore, it can be concluded that at least one student will not graduate this
sémester unless the student does not play volleyball.
B Convert the statement (x ’ (yA w)) ^(z’ (y Aw)) into PDNF fornN (CO#1|
Q. No. 2 |Sx2|
A Show that among any n + 1 positive integers not exceeding 2n there must (COW2|
be an integer that divides one of the other integers.
B If the computational complexity of adivide and conquer algorithm is (COw2]
determined using recurrence relation f(n) = 2f(Vn) +1, (1) =1,
where n is a perfect square, what is the big theta (0) estimate for the
complexity of the algorithms?
Q.Ao. 3 |Sx2|
ALet A={a, b, c, d} and R a relation on A defined as CO#M
R={(a, b),(b, a). (b,c), (c, d)}. Is Ra transitive relation? If not, find the
ransitive closure of R.
2 3 4 5 ICOW)
BIf A= {1,2,3,4, 5, 6) ,P, =( 4 1 2 6
2 3 4 5 2 3 4 5
P22 3 11 5 4 6P: 3 2 5 4
Find (p, op,)"p, . Is the resulttng permutation odd or even?'
Page I of 3
 9Ao. 4 [5x2]
Let A =(a, b, c, d, e, f, g, h} and R be the relation defined by |CO#3|
(1 1 1 1 1 1 1 17
1 0 0 1 1 0 1
0 0 1 0 1 0 1 1
00 1 0 1 1 1
M¡ = 00 0 1 0 0 1
00 0 0 1 0 1
|0 0 0 0 0 0 1 1
0 0 0 0 0 0 1!
H/Show that (A, R) is a poset.
sá) Does the poset (A, R) have a least element and a greatest element? If
s0,fdentify them.
i) Show that the poset (A,R) is complemented and list all pairs of
complements.
Kivy Prove or disprove that (A, R) is a Boolean aigebra.
B Let * be a binary cperation on a set A, and suppose that * satisfies the (CO*3|
idermpotent, Commutative and Associative Properties Va, b, cE A. Define
a relation S on Aby asbif and only if a= a+b. Show that (A,S) is a
set, and for all a, bin A, GLB(a, b) = a*b. (Note: GLB(a, b)=anb)
No.5
ACompare isomorphism and homomorphism of semigroups. If Zis the s.i of iCO#3)
integers, T the set of even numbers and x is the multiplication operator,
prove or disprove that the semigroups (Z, x) and (T, x) are isomorphic.
BState the Boolean polynomial for the function, f: B4 ’ B given by logic |CO#3|
diagrarn show in the
figure.
Ce the properties of
BBolean alzebra (or
any graphical rnethod)
to refine the
polynonial to use
minimal number of
variables and
operaor.
Drawgic diayrarn for the new Boolean polynomial.

Page 2 of 3
 |5x2)
of the possible spanning trees for |CO#4|
Drawthe digraphs graph is given
the symmctric relation whose trees arce there?
spanning
alongside. How many
codes E01 to E08) for 2nd |CO#4]
offers 8 elective subjects (with of the number of students
BA collegestudents to choose from. The data tabulated below:.
Semester
Subject, and Subject is as
registeredfor both Subject, Subject
Subject, | Subject, E05 E08
E04 e) E03 8
E01 E08
E07 6 E06
E04 E03
b)
E07
E02 g) E06 E01 11
4 h)
of two subjects,
C EOS
E02 examination
d) the not
will occur in the timetable if time-slot results in astudent
Aclash same the
conducted during the of the subjects for which
which are of one
able to take the examination
being
student is registered. examination per day, in how
only one examination be
Assuming that a student takes can the end-semester
) numbers of days elective subjects?
minimum for these
many in the timetable
conducted without any clash time-tables can be generated for
the
different clash-free elective subjects? (Hint:
(i) How many End-Sem Examination
for the
of
conduct ofgraph colouring)
Application |5x2)
Q. No. 7 fully parenthesized [CO#4]
tree for the
Construct a labelled positional binary (e+(f*g)). Assuming that
A
algebraic expression ((a +b) - c) x show the result of'performing a
the label of v,
visiting a vertex v printsconstructed binary tree.
post-order search on the wished to send out a
[CO#5|
formed entrepreneurship
B The CEO of a newly major clients across 5 towns, T = (t, tz, tg, t4, tg.
sales1man to visit all these towns is
The travel cost between 7 50 1 1
=nifthe
givenby the matrix C, where Ci 0 3 50 8
cost of travel from town i ioj is (7 X C=so 3 0 6 2
7
1000). If the headquarters of this 1 50 6
2 7
establish1ment is located at ti, write a
l1 8
round
program to find the most economical minimum cost of the trip?
strip for the salesman. What willbe the
Page 3 of3