Scribd
Upload
22 views2 pages

Math (DM) (5th) Dec2020

Math

Uploaded by

aaruhiibhardwaj3246
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
22 views2 pages

Math (DM) (5th) Dec2020

Math

Uploaded by

aaruhiibhardwaj3246
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

e- Irllo towllNH

Total No. Of Sheets ljsed.. 02 Tolal No. Ol'Questions ---09 - €€ ivl;E'


Tirne :- 03 hor-rrs Max. Marks:- 40 Paper:- Discrete Mathematics,-If Min.Marks:- 14

\ote:- The candidates are required to attcr-lrpt '&er., - question each from Section A,B,- : - and

Sectron€ is compLrlsory' .

SECTION A

1. A)Prore that mod tn relation is an equiraience relation


r-\
J) |Lci
.,r F.:iiI) .; iiI) ijuiii:iCC
/, uj jr/..\
.l^+:,-^,I !,, .,;:) -- .2 n
r= ."-.iii'C;C lhat rr iS nCitllei'Cr:e-Oli3 IlOi'C;itO.

2. :r There are -150 ianners in a large region. 16[) tam beetroot. i0C farm \ams.70 fann radish..10
Iarm beetr..,ot and radtsh. -i[) ianu rants and radish. and,10 fanr bcetrorrt and \ams. Let B. Y. artd R
denore the set of t'arms that farm beetroot. rams and radish respectir.elr. Deterntine the nuntber of
l-anners that tarm beetroot. \'ams. and radish.

b) Drau'Hasse diagram of D,oo. where D,cienotes ihe set of positive divisor of n.

A) Prove that Drdenotes the set of positive divisor of rz is bounded distributive lattice.

o; Statc a,,ci pio, i i.i,iiuu;l;.)-j Ii,:-';':r:r :: j :trir:.

4. A) Let A = {L,2,3,4} and relation on it R = {(a,b): la - bl = 2}. Find transitive closure ofR.
b) A function f is invertible iff its is one-one and onto.
(:rX t L
"' t
SECTION B

5. a) Find Minimal s1:auing tree oI rveiglrtcd


")--rl/
using Prim's algorithim.
l" - -Y- {
V
--t-li- Cd
3 ,')

ct c-
b) Find number of Spanning Trees of given figure

6 . If G is connectecl Graph and every r,/ettex G is of evcn degree, then prove that G has an Euler Circuit.

7 a) Show that K3,, satisfies the inequality lEl < 3lyl - 6 brrt is rtot planer..

b) Prove that the nraximum number of nodes 9f clepth r/oI'the binary tree is 2tt - T,where d >1

8. Draw binary tree rvhen Inorder and Post order traversal is given: &y!
'Z
-2-
- ln order: mkn.i olusttetpr

Post Order: m n kou v s t q r p I i

b)Provethatsimplegraphwithk-componentSandnverticeScanhaveatthemostofryedges.

SBCTION-C

e)

a) State and prove commutativity law cf sets.

b) Let f beafunction f(x,y) =x.Showthatf iscomputable.

c) Define Grammar and Turning Machine

d) Define Preorder, Post order, what is their application.

e) Give example of a Graph which is Euler circuit but not Hamiltonian cycle.

0 For a group photograph, I I boys and 5 girls stand in a line in all possible ways. How many photos

could be taken if each photo corresponds to each such aruangement.

g) Find horv many arrangements can be made rvith the leth:rs of the rvord 'SUCCESS'?

h) Discuss'l'hree Pigeon hole principles. 37a 3 )&

l,Li,kll NH

You might also like