Cse202 DMGT (S)

You might also like

You are on page 1of 7

SET II

G ,S. Mandal's
MAHARASHTRA INSTITUTE OF TECHNOLOGY,
AURANGABAD
(An Autonomous Institute)

Name of the Examination: Second Year B.Tech (Computer Science & Engineering) Feb/Mar
2023
Name of the Course : Discrete Mathematics and Graph Theory
Course Code : CSE 202

Name of the Expert :Mr. Rahul Mapari


Designation : Assistant Professor
Department : Computer Science and Engineering
Contact Number :9028084446
S.No Sub Marks
Q.No

I a Define Proposition 2

Answer: Marks

Is a statement which is either true or false but not both at the same time

b Represent following set with set builder notation 2


oo
A is a set of all integers greater than 10" marks
Answer:
A:{xl x)I0, x is integer}
c Let P:{a,b,c} and Q:{1,2,3,4}, and f: P-> Q such that 2
f= {(a,2),(b, 1 ),(c, 1 ) }
Marks
Find the domairr, and range of function
Answer:
D(R ):{a,b,c}
Rn(R)={ 1,2}
SET II
d What is combination? 2

Answer: marks

In mathematics, a combination is a way of selecting items from a

collection where the order of selection does not matter, Suppose we have
a set of three numbers P, Q and R. Then in how many ways we can

select two numbers from each set, is defined by combination.

e Give the degree of each vertex for the below graph 2


b ( d Marks

a
a f e o
cl

Answer:
a:2,b:4,c:4 d: |o e:3, f:4, g:0
f Define Semi Group. 2

Answer: marks

An algebraic structure (S,*) which has associative property is

called semigroup.

G Let, P:{ 1,2,3,4\, Q={a,b,c} and 2


R= { ( 1,a)(2,b)(3,c)(4,c)(4,b) }
marks
Find Complement of R
Answer:
Complement of R: {( 1,b),( l,c),(2, a),(2,c),(3,a),(3,b),(4,a) }
H Draw Kz,r and Kr,s 2

Answer: marks

I
a
SET II
2 L!sc ntllhctnltical intlultinn lri s[rorr' thir{

! -r-l rll -.". * l" = rri' I * 1

8
lnr lll nonnct:ttit'c inttgcrs rr.
marks
.!,.:i..'r. : l,{'tPillbcthrpnrpo:iitiolrtlurtl-r I t l:"r "-il" n }nil .* llbrthcinicgclrr.
l; i'..'.' .ill l't{!)rstl'usbc(itusrl"= l-:l l..I'hiser,lnpld{sthch;rsisstcP.
i!.\..i iiii i,r! i ;rl j'. Forthc'induttivchJ'F)th!:sis.\\'cit"lsurllcthill l'{*ri.slnrclorlnorbitrary
-l'h*t
norurcgltjr,c inttrge r l. is. u'e nssunre lhl(

I'r-l+l:+. -r-It * ll'1 - l.


-frr
clrr} nur thc intluttivr: st.1'r using this us-strrnpliirn. \vc lr'rus! shou th;rt u'hcn q'e ltssunlc
thltt I'tA t is tntc, llrr,rrt /'nt* -+ lr is;rlsrr true. Tlrat is. n'c lllurl shrrrr th;rl

t r 1 r-1
r'r'-*-J''f:ii , r{ r{rl _- r,{-lr.: r - ri;l I
t

itssuming thc indui tirr hl irttlre"sis l,r[-t. Llnr.lcr thc assrrlrptitrrr ol' /'{ A l, \\'(: scr lhetl

lt+---.+t-i',:
, a, r-l , ri rirl * (l +l+ l:+.. +'lijr ri'l
' t-
ri l r.
I I
ri
' -

r _r; I r
I
-_
rl, I r

Nole thrt $'e u"sed the inductivr hl'poth(:sis in lhe srrtrrnd t'r:Frirlion irr this slring of equalitie+ lo
rtrplli6:r;r l+l+l-r+. '+lrhrli-l * 1.l\it'h;rr,i:conrptt:ttxl thelndur'tivcstep.

rvekrtlrrvlhat /Jtrrtislnrclirr;rll nrirrnclillivcinltrl:r.rsrr.l'h;.rtis, l* l+ . -il'- rr"l - I


lor irl! n(ltlncgllivc ittlcgr'rs rr. 'l
OR
Demonstration That p v (q A r) and (p v q) n (p V r) Are Logically
Equivalent.
Answer:

Fq r q
^f lrYlg^tl Pvq lt 't t, {1, v {l ^ lp v rl
,l
1'
.l
I'
a

t- 1' i 1 v

't' 't'
t: i
F t" I 1'

1' t: 'l' i t; 1'


.T
t T
"r L' [: F t" 1. T t

F T T 'r 1"
'r
1' T
F 1- F I:r !;
'r t; ri
,I 't'
F F' t" t; t- l.'
F, F I l: L F
t^'
I

3 A total of 1232 students have taken a course in Spanish, 879 have taken
a course in French, and 1 14 have taken a collrse in Russian, Further, 103
have taken courses in both Spanish and French,23 have taken courses in
both Spanish and Russian, and l4 have taken courses in both French and
Russian. lf 2092 students have taken at least one of Spanish, French, and
Russian, how many students have taken a course in all three languages?
SET II
Answer:
Let S be the set of students who have taken a course in Spanish, F the set
of students
who have taken a course in French, and R the set of students who have
taken a course in Russian.
Then
1.s.= l2-1J. ltl * 1i79. l,(, * ll.l.
1J'/': y''l -- l{}3. i.S'rrti = ll. if '' ftj = ll.

rrntl

l.f ..., l Li Al = 1091.

\\'hr:.n *'c in.st'rt thcsr quantitics irrlo llrc r.rFti.rli(u

lSi.ili.Jfl =l"l +l/; +:All-l.tr'-t *,$l-tfi| -if .r/t, + Srtf-,^rql


rvi: t:blain

l09l * llil+879+ ll.l- lt!.] *:"1 - l{+ 15.rf itfi .

Wc norv solvc lilr ls n /' {"t Ri. \\rr lind thut ;5 ,* f' ^ fii -
7."I1:rlr:lirrr. ihclr urc st'r,cn sturlents
u'lro have li*crr courscs in Spanish. I-rr:nch, and Ru.rsi*n.'fhi:i is illustrattrl in Figur.r 4, <
OR
Draw the Venn diagrams for all set operations
Answer:

.t , tl

at

'I S{

,t

4 Let, A:{a,b,c,d}, R:{(a,a),(b,b),(c,c),(d,d),(b,a),(d,c)}, determine SMark


whether R is an equivalence relation.
S
Answer:
The given relation is reflexive, symmetric and transitive.
So it is a equivalence relation.

OR
Let A= { 1,2,3 }, R= { ( 1,1),(2,2),(3,3),(1,2),(2, 3 ), ( l, 3 ) }
Determine whether R is partial order relation or not.
SET II
Answer:
The given relation is reflexive, antisymmetric and transitive
So it is a partial order relation.

5 Use Dijkstra's algorithm to find the length of a shortest path between the 8
vertices a and z in the weighted graph displayed in Figure
Marks

17 t/..' rJ'r'
4 6

tla t
(,
'X.

2 J
g'J,, g '/-.

Answer:

b ,l :,.,.
n

Itrl thr ir I

.1

{l)

OR
SET II
Represent the graph shown in Figure with an incidence ma trix

1'l l.', t']

l,+ iI I

Answer:
rJ ] ('l {'"1 t'_i .'0
t' j [r ] tt {} t} ul
l': Iil il I I {, tI
l .l i ,, r {r tt l t l

l-a
Itirl{}l},}l
t: Lil I rr I I {'l
6 Explain the product rule and sum rule with exarnple' 8
Answer: Marks

The Rule of Sum and Rule of Product are used to decompose difficult
counting problems into simple problems.
. The Rule of Sum - If a sequence of
tasks Tl ,T2,..,,Tmcan be done in w1,w2,..'wm ways
respectively (the condition is that no tasks can be
performed simultaneor'rsly), then the number of ways to
do one of tl-rese tasks is wl+w2+"'*wm. If we consider
two tasks A and B which are disjoint (i.e' AllB:@)' then
mathematicallY lAuBl:lAl+lBl
. The Rule of Product - If a sequence of
tasks Tl ,T2,...,Tman be done in w1,w2,..,wm ways
respectively and every task arrives after the occurrence of
the previous task, then there are w1xw2x"'xwm ways to
perform the tasks. Mathematically, if a task B arrives after
a task A, then lAxBl=lAlxlBll
llxample
Question - A boy lives at X and wants to go to School at Z. From his
honre X he has to flrst reach Y and then Y to Z. He may go X to Y by
either 3 bus routes or 2 train roLltes. From there, he can either choose 4
bus routes or 5 train routes to reach Z. lfow many ways are there to go
fromXto Z?

solution From X to Y, he can go in 3+2=53+2:5 ways (Rule of Sum).


-
Thereafter he can Y to z in 4+5:94+5:9 S Rule of Sum . Hence
SET II
(Rule of Product)
from X IoZhe can go in 5x9:45 5x9:4 5 ways

OR
Prove that tlre structure (Q,+") is a Field

Answer:
The (Q,+; has following ProPerties,
a, Closure

b. AssociativitY
c. IdentitY element
d. Inverse
e. Commutative

The (Q,.) has following ProPerties,


a. Closure

b. AssociativitY
c. Identity element
d. Inverse
e. Commutative
So, the given ring is ring of unity as it is having multiplicative
identity and it also has cumutative property'
So the given ring is Commutative ring of unity'

AndeveryelementinQhasamultiplicativeinverseosothegiven
ring is field

You might also like