Scribd
Upload
25 views2 pages

Discrete 2023

The document outlines the examination structure for the Discrete Structure course for 2nd Year B.Tech students in the Odd Semester of 2023-24, detailing the maximum marks, duration, and instructions for answering questions. It includes various topics such as set theory, functions, lattices, recurrence relations, combinatorics, and graph theory. Students are required to answer specific parts from each question, demonstrating their understanding of the subject matter.

Uploaded by

p3595885
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
25 views2 pages

Discrete 2023

The document outlines the examination structure for the Discrete Structure course for 2nd Year B.Tech students in the Odd Semester of 2023-24, detailing the maximum marks, duration, and instructions for answering questions. It includes various topics such as set theory, functions, lattices, recurrence relations, combinatorics, and graph theory. Students are required to answer specific parts from each question, demonstrating their understanding of the subject matter.

Uploaded by

p3595885
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

ROLL NO

SubCoe: CST082

ODD SEMESTER EXAMINATION, 2023 - 24


2nd Year,B.Tech- (CS&EJAI&ML/IT)
Discrete Structure

Max Marks: 100


Duration: 3:00hrs
carry equai marks. In case of any ambiguity or missing
Note: - Atempt al questions. Al Questions assumption made in the answer.
deta thesame may be assumed and state the
5x4-20
Answer any four parts of the following.
that
a) IfA and Bbe finite sets and f:A ’ B. Then show
()ffis injective. then |A| s |B|
() Iffis surjective, then |B|<A|
12 + 22 + 32 + .....1 =
b} Using mathematica! induction method verify that
(+1)(2n+1)

are surjections, then show


c) Let f:A ’B and g: B’C be functions. If f and g
that gof:A ’Cis a surjection.
ax + b, where a,b,x E
dË Show that the mapping f:R ’ Rbe defined by f(x) =
R,a #0 is invertible.
(A - B)U(A C)
e) For any three sets A, B and C, prove that A - (B n C) =
)Define the following: (i) Multisets (ii) Union of
Multisets (iii) Sum cf Multisets
(v) Intersection of Multisets (v) Difference of Multisets
5x4-20
Q2. Answer any four parts of the following.
a) Prove that the proposition~ CpA ) Vq is a tautology.
sublattice.
b) Prove that the intersection of two sublattices is a
and only ifAX B is
c) Prove that two bounded lattices A and B are complemented if
complemented.
contradiction:
a) Determine whether the following is a tautology, contingency and a
()p ’ p ’ ) (ii) p’ (q ’p) (ii) pAp
e) Consider the poset A = ({1,2,3,4,6,9,12,18,36 } / ,find the greatest
"lower bound and the least upper bound of the sets { 6,18} and { 4,6,9}.
f) If L be any lattice, then for any a,b,c EL, prove that a v (b Vc)=
(a vb)Vc. 10x2= 20
03. Answer any two parts of the following.
2) Solve the recurrence relation ar+2 -5 ar+: t 6 a,. = 2 by the method of
generating functions with initial conditions an =1 and a, = 2.
b) (iyHow many 11 letter words can be formed using the letters of the word
JNSTITUTION.
Prove that C(n,r) = C(n - 1, r) + C (n- 1,r- 1).
c)Among the first 1000 positive integers, using principle of inclusion and exclusion,
determinethe integers which are not divisible by 5, nor by7, nor by 9.
Answer any two parts of the following. 10x2= 20
Q4.
a) If R, be the multiplicative group of all positive real numbers and R be the
additive group of all real numbers. Show that the mapping g:R4 ’ R defined by
g{x) = logx Vx E R, is an isomorphism.
b) Prove that the set of all positive rational numbers under the binary operation *
defined by a * b = "" is a group.
2

c) Show that a commutative ring R is an integral domain if and only if for all a, b,
cER(a # 0) ab = ac h=C.
Q5. Answer any two parts of the following. 10x2=20
a) Apply Dijkstra's algorithm to the graph given bclow and find the shortest path
from a to f:

6 d
2

a 2 3 f

C e

b)If alinear graph has exactly one path between any two vertices.The linear graph
is a tree and Conversely. Explain it.
c) If G be a connected planar simple graph with e edges and v vertices. If r be the
number of regions in a planar representations of G, then show that r = e-v+2
***********

You might also like