Reg. No. :.... Q.P. Code : [23 SC 05] (For the candidates admitted from 2023 onwards) B.C.A/B.Sc. DEGREE EXAMINATION, NOVEMBER 2024, Second Semester Part III - Computer Science/Computer Application/ Computer Technology/Software System/Multimedia and web Technology/Information Technology/Hardware System and Networking/Computer Science and Application Allied - DISCRETE MATHEMATICS Time : Three hours Maximum : 75 marks SECTION A — (10 x 1= 10 marks) Answer ALL questions. Choose the correct answer. 1. Which of the following is not correct (a) xe {x} (b) x} c {x} (©): $= {0} @ dats} @ scanned with OKEN ScannerTEAC B, then AU(B- A) = Vos (@) A ) B © © AnB eee u P and q are two statements —_————— is Tue statement when both p and q are false, otherwise false (a) ptq 6) psa (©) pla @ q=p Which of the following is not equivalent (a) ~(paq)=~py~q (bl) ~@ pag=~pyva © ~(pa~g=-Ppva @ ~(@py~a)=paqa Let A and B two nonempty sets. A relation from A x to B is a subset of (a) Ax B (b) AUB («) AaB (@ A-B yr of If |Al-mand |Blen, then the number © elements in Ax Bis (a) mn (b) m+n on™ 2m" (d) 5526 2 @ scanned with OKEN Scanner9869S € G q eoa-w © qo j z (yu) (y+) ae (I+ 4~¥) (4-2) . ULYY dou savy Jou. syuaUOdUIOD y pue seoiiaaA ou YM 9 ydess ardurs Vv qutod ng (p) qeyomelq = (2) quspueg (q) peyefosy (e) payoauuoostp slay ft poyeo st a xeyea Py Gace (0) Y-.% @) 1-3 @ 3-7 () se pourep SIZ 0} qoodsor YIM oSenZury ve Jo yuowu[duroo ayy, [n] ou Ue % =| | wey To =7 pur {t= Inji @ (P) (q) u Ol (® scanned with OKEN ScannerSECTION B — (5 « 5 = 25 marks) Answer ALL questions, choosing either (a) or (b) from each. 11. (a) Prove that (A@B)U(ANB)=AvVB. Or (b) Find all the partitions of the set A={a,b,c,d}. 12. (a) Show that (P=Q)>Q tautologicall imply Pvq. Or (b) If p and q are two logical statements, then show that ~ (p= q)= PA~q- 13. (a) IfRand S be relations on a set A= 41,2,3} 010 represented by the matrices Majz=\1 1 1 1090 010 and M,=\0 1 1 Find RUS,ROS and til ReS. Or jvalence relation on 4 set A, (b) If R is an equ js also an equivalence Prove that R? relation in A. 5526 @ scanned with OKEN Scannervuan S ‘(O-@)-(9-y)= 9-(@-¥) 3ey Moyg —(q) 19 ésururutms pue yd ut peisetozur pue AydesZoj0yd O pue SuTUTMS 0q ut peysetoqur ane OIsnu ut you Mq Ayderg0 40 ore Aweur mop “Surmutms ‘SIsMUL ut PeqsereqM st ou pue Ayderzojoya U (® scanned with OKEN Scanner y pue Sydergojoya U t Ut peqsertoqut are OT ‘suosied gz, jo dnoid v Uy (eR) “Yee woay (q) x0 (e) toyHe Zuisooyo ‘suorjsonb TIV tomsuy (SyxeW OF = g x ¢) — 9 NOLLOGS ‘sojduexe yin Ydearsqns v yo JUeuslduos pue —-ydea8qns Suwuedg 2 suyeq (q) ‘OT 10 ‘eidmexe yy yders peyoUtlod ¥ Jo LeyeuIEIP pu SOURISIP ouyaq —(v) We Cae gqweyywegy=g Srey as td'S'(Q')(E'V'S}= 9 TeUUBIs SULMOTIOF ayy Aq payetousd a8ensuey, ayy pury x0 ; : “LT GT Puy woyy (q'0)=% pee i intomvis 7 ay} Tero aBunsuyy vo aq {o'qv}=7oan Quantifiers wi e Properties of Quan ith example. tifiers, Or () Establish r is the valid , arguments p= 9, pv rand gn fom th Show that the co: mposit: ’ associative law, Position of functions obeys 18. (a) Or Show that an equivalence re’ non-empty set A determines a Partition of A and conversely, a Partition of a defines an equivalence relation in A. (b) lation R in a 19. (a) Consider the language — L = {a"b’ Find grammar G which generate L nel Or netr » all stron P at accepts a . Jonstruct a DFA that ac » atl area (b) Con fa, by which begins mod and ef also f ransition table b also find state transition 7 vratione “uss various Opera 20. (a) Dise uss ee with examp Or aejon tree f aw the express a a Oo and hence sypressiod one ix form oF poe b-oedt ert) Cs 9 eo 5526 6 @ scanned with OKEN ScannerReg. No.: . 80. > Q.P. Code : [21 SC 05] or the candidates admitted during 2021-2022) B.C.A/B.Sc. DEGREE EXAMINATION, NOVEMBER 2024. Second Semester Part III — Computer Science/ Computer Application/ Computer Technology/ Software system/Multimedia and web Technology/ Information Technology/ Hardware Systems and Networking/ Computer Science and Application Allied - DISCRETE MATHEMATICS Time : Three hours Maximum : 50 marks Answer ALL questions. SECTION A — (10 x 1= 10 marks) Choose the correct answer. 1. If A is a finite set of n eléments, then the total number of subsets of A are (a) nv (b) 2" C2. (a) 2° -1 @ scanned with OKEN Scannereo a . Aah NAR . y Whiots of tt WM vay . e, \ ww et A pmpoaition Ly NN ’ we Dink “ here is no Rain to a es Rai today ty Delhi ry 8 ‘ (@ xeyer ¥ serine which of the condit y ely o€ the conditional stagonnent 18 ‘ & @ & thon L150 ©) g, then cats can fy © 2. hen cows ean OY @ 1, don t A yelation on the set Aww said to be w R=A* A st I Polation (a) jaentilY relation wv) Void rel 7 calati y R aflexive yolaiol © niversal elation Ke pond —_ | @ scanned with OKEN Scannergoss (-wa-r Ae) @-ya-y% | (t-wuZ (ey P2qdeuUON st UOUT eospo ee weyy srow S¥Y saotqt0a u UHM » ydeas edus wy ‘OT yders s4e[duI09 (p) ydeas Opnesg (0) ydei3 regex (q) ydeas giduirg (we) “~~ P29 st pamorre ere se8po etdytnu pure sdooy yorym ur ydea3 e uy 6 () 53Y ©) @ (e) 324100 Jou st SuLmoTfoy SUI JO WIM -g “= (4) “= ©) 4=4+4 (q) 4=4+QM (R) 21109 You st SUTMOTIOF 8U} JO Yor 0 (©) u z eyugut (q) uG ———— stg xy UT S}USTHATA Jo szaquinu useyy Ayduro ST 19Y 0 pus sqrurgur st g 20 y rout (® scanned with OKEN Scanner6 SF o AY SS y ¥ s sis ee. SECTION B—@6x3=15 marks)” & oe , S 2. Answer ALL questions. ’ ew SS eS ¥. 11. (a) Prove that the symmetric difference ‘e’ = associated in set operation. Or ~ Ss (&) Show that . : I union is distributive over } intersection in set theory. If p and q are two statements, then show that (ptq)@(pta)is equivalent to (pva)v(p tq). Or (b) If p,q and r are three logical then show that [(p=>q)nla=r 13. (a) Show that the relation < the power set P(A) of the order relation. Or (b) IfR and S are ea A, Prove that (RUS) oh uit We @ scanned with OKEN Scanneroct 1, ={a,ab,b? Jana TL, = {b",aba} be two languages over the alphabet 2 = {a,b} Then find out L,L, and [2, y y Or (>) Explain the different types of grammars. (a) Define a regula: © graph and biopartite graph with examples. Or &) Define walk, Sraph with ex, SECTION C—6x5= 25 marks) Answer ALL questions, (a) ATV survey sh, Path, circuit and cycle of a amples, per cent People see Programme A, 50 Percent see Programme B, 0 Percent see Ogramme Cc, 30 Percent gee Programme A and B, 20 Percent see programme B and C, 30 Percent see Programme A and ©, and 10 bercent do not see any Programme Find @ ~~ What Percent see Programme A, B and Gi) What percent gee exactly two Programmes? Gii) What Percent see programme A only? Or 5 RANE @ scanned with OKEN Scannerer w sadayu? aanqisod pv) ft qpuo puP fqae st ‘gzasoqut Tey rey mous yo 40! 10 Be J= rd) yeu Moygs UL sguoryouny o[qttoaut puege xf wT ©) St omy fue eq goK we bDun(b~ vd) ~ squeumnsie ayy WLOy uorsnpouod pred ayy std ~ ystqeysil (q) (® scanned with OKEN Scanner dt Ne _ © ° g &e SATBIOOSSE JOU NG § 2 BINWITUOD SE | aAtoouUOD oY} Jy} MOUS (e) cL % G s xS.\ (onv)-(anv)=(0- Mv é § am 4 Rg gt UB JOJ JOU JO AOYJOYM AJMeA (q) work~ (b) (a) (b) (a) ct) (a) (b) © show that the o ey ¥, onnective T i & but not associative + is commut é & TH Or ae 8 x X Establish ~ pis the vali : arguments ~(pa~q), ee conetwsion from the et 7% c f:X > ¥ and g:Y>Z be any two invertible functions. Then Show that Gop face. Or Show that the relation R on the set of i * defined as divisible by 4 lence relation. integers, is aRb if and only if (@ —b)is nteger Mm js an equiv’ positive in ={prab" n= oyFind Consider the language L grammar G which generate L. Or state automaton M that Design 4 finite \ accepts those strings from y= fab} whicl have even number of ‘a. 5a 6 @ scanned with OKEN Scanner—————______ “(@-9+ d)/(p 40-2) : dxe ay Jo WO xmsod Pu as TIM olen pue worsserdxe sural xpoid oF uowserdxe ay; «we (q) 10! oar} ay F a a -gaspe (I+ yA) guodwoo ¥ pur yey Aroys: avy you ea ut 2. 4 940 ino ud ued qos u gaol} (® scanned with OKEN Scanner