wevew UiTAutosomous) RGPV, BHOPAL ‘Examiaation: May-June 2024 ‘Time: 03 hes ‘Subject Code: CS-301 ‘Subject Name: Diserete Structures ‘Max Marks 105 Instructions: Attempt all questions Parts ab, ¢ of each question are compulsory for which the alloted marks are 344 respectively and d &e part will have an internal choice for which the alloted marks is 10. AM subparts of a question should be ansmered at one place, Q.No. Te (AUBY=ATB™ ANBAR. i © example? Explain is vriouselasieation. r {e) | Prove tt (i) AX(BUC)>(AXB)U(AXC) (i) (A-B-CHAXCBUC) | (a) | Using the Principle of Mathematical induction, Prove that r Bede t wt (106 fala 1) Qu D) forall ne. ‘oR co oO Ta a survey of $00 studenis of a colegs, H was found that 49% Tiked watching Yootbily 33% liked | ‘watching hockey and 62% liked watebing basketball. Also, 27% liked watching football and hockey boty 20% liked watching basketball and hockzy both and 28% liked watching focthall and besket ball both. 3% {ikod watching none ofthese games. How many students like watching all the three games? Find the ratio of number of students who like watching only football (0 those who like watching only hockey. Find the number of students who lke watching only one ofthe thor given games, Find te numb of todeats wha lke watching atleast two ofthe siven games. 2a) Define a Binary operation’? Write down te roperties of Binary operation (| Consider the algebraic system ((0,1},*) where * i Multiplication Operation. Determine whether (0.1). isa Semigrovp. © ‘Conupare Ring and Field. Take any example 1 claborate the answer. (0) Diferente between sorerphism and Homomorphism of groups wih an exampTe? OR, Te] Ceaser an aigeaieexpression( O°, where Qis the se of ralonl mambers and * isa biary operation | 2 defined by avbeatbeab ¥ a,b €Q. Determine whether, *) is group. Prove that: pwgar) = (pvg) A (pvr). 3 ‘Prove by th table that he following Tormula a tology: 3 =a (=a=>~p) A(g=> 9) => (p==>9) w Define te terms with example supporting to ear (8) Prepositon (6) Conpoundpropoiion (@) 3 Disjuncion and Conjunction - {H Translt the following into symbole fonn ad test the validity ofthe argument z “fis even thea’? does not divide 7. Ether Sis not prime o€2 divides 7. But Ss prime, therefore sod” OR ‘Show that the premises “If you send we an email message, dben Twill finishwriting the program "Iyou [3 ‘donot send me an e-mail message, then Twill go tosleep cary.” and “ICT go to sleep early, then Twill ‘wake up feeling rfeshed"lead to the conclusion “IT do not finish writing the program, then will wake i ‘edn refreshed” Aa) Differentiate between Multigraphs and weightederaphs._ a Tibi | Row ean you dw a rah fom agen adjacent mats: Give an exalts explana 2 Ac) ‘Explain: (i) Isomorphism of graph (ji) Homomorphism of graph 4 (| Write Short Notes: 4 (Chromatic Number) Esker Path Gi) Hamionion Crit iv Planar Graph ‘OR (Find te tre tance om sours verex "io end veri © ne Towing ap: + (a) pla media atic, ine ate and toandad aie wth ame andra 3 o) Define permutation and combination with. ple. 3 © ‘Consider the set A= {4,5.6,7). Let R be the relation on set A. Draw the directed graph and the Hasse | $ diagram of. | Find te parte solation of ie i nL 3 © [ Salve the difference equation: Bo Ge, + 98 = 3 wh lal condlions a-Oand ai 1S)(jcampusly.in UlT[Autonomous) RGPV, BHOPAL Exomination: Nov-Dec 2023 ‘Time: 03 hrs Max Marks : 105 ‘Subject Code: ¢5 301 Subject Name: DISCRETE STRUCTURES Instructions: Attempt all questions. Parts a, b, ¢ of each question are compulsory for which the allotted marks are 3, 4,4 respectively, and d & ¢ part will have an internal choice for which the allotted marks is 10, All subparts of a question should be answered at one place. [@.No. | Question leo [(a)__| Prove that (i) AX(BUC)=(AKBJULAXC) (i) (A-B)-C=A-(BUC) a {b)___| State and prove Pigeonhole principle with example? _ ia {) | Prove by Mathematical induction: a 14243444...tn=[n(n2)]/2 — 12) | Among the first 500 positive integers: z {a)Determine the integers which are not divisible by 2, nor by3, nor by 5. | {b)Determine the integers which are exactly divisible by one of them. | OR he ‘Consider the functions f,g:R->R defined by 1 H(x)=n’ 43x41, gx)=2H-3 | find the composite functions (i) fof (i) fog _{ii) eof | fa) what do you mean by Binary operations? Write down is 1z {b) Consider the algebraic system ({0,1}, ) where * is @ Multiplication Operation. Determine whether | 2 ((0,3},*) is a Semigroup. (0) Differentiate between (i) Ring and Field (i) Homomorphism and isomorphism of Groups 2 | (a) Consider a ring (R,+,") defined by a*ara. Determine whether the ring is commutative or not. 2 OR Te) 1] Consider an algebraic system (G,*) where Gis the set of ll non-zero real numbers and *isabinary | 2 operation defined by a*b=ab/4.Show that (6,*) is an abelian group. _| [Bia) >| Verity that PU=(PAQ) Isa Tautology? - 3 {b) — | What are Logical Connectives? Explain the following terms : {i) Negation 3 (i) Conjunction _(ii)Disjunction Td ~ Differentiate between Existential quantifier and Universal quantifier with relevant example. 3 (a) | Test the Validity of following Argument. “If! will select in AS examination, then | will not be able to go |) 3 to London. Since,| am going to London, I will not select in IAS exomination.”" | oR | fe) | Determine whether the following are equivalent, using biconditional ‘statement. 3 (2) Pe->==(prqhv(“pr-a) |__bb) (pPq)Dt==(pr“g)>t_ | ~ [{a)___| Define isomorphic graph with relevant example. a tb) ‘Show that the sum of degree of all vertices in G is twice the number of edges in G—_ 4 (| Explain with examples: 4 {a)_Euler Graph (ii)Hamiltonian Graph (ii) Complete bipartite graph __= (a) ‘Draw a graph with six vertices which is Hamiltonian but not Eulerian and (b) Eulerian but not 4 Hamiltonian aa OR te) Explain Dijkastra Algorithm to find shortest path in a ‘weighted graph. Take any one graph to elaborate | 4 the algorithm. - ‘S{a) ‘What is Lattice? Write down the properties of lattice. Give an example of a Poset that s isnot a lattice. - (b) State Binomial Theorem. 5 ( ‘Consider the set A={4,5,6,7).Let R be the relation <= on A. Draw the directed graph and the Hasse 5 diagram of R. | (a) Find the particular solution of the difference equation 5 east ered oR @ Write short notes: (a) Permutation and Combination (b) Multimonial Coefficients, 5esteetes. and de part wll have an internal choi for WHI Bots auction should be answeredav one ne ; Teo we ienahads a — col ther sik ave equal where A=, 2,3, Aland O= 2.4, 2.3) — coe Draw Venn diagram with proof of identities: niAUD) = A(R) +n) ANB) —— ay con Among 100 students, 32 study mathematics, 20 study physics, 45 study BiolOBY mathematics and biology, 7 study mathematics and physes, 10 study physics 38 Ot and 30 do not study any of three subjects. Find. The number of students studi | three subjects if The numberof students studying exactly one of three subj sc con [V's 9 universal set and its two subsets A and 6, then prove that (AUB) = A’0! OR =a oor Using principle of mathematical induction, prove that 1.3 +3.5+5.7 + +(2n-1) (2n+3)213:n(an2+6n—1) coz Theorem Prove that Every cyclic group san abelian group co2 Show that the set G = (1, 1, j,-i) where i= =1 is an abelian group with respect to multiplication as a binary operation for a group G, f: G > G is given by f (x) = x2, xG Eis ahomomorphism, prove that G is coz abelian oF _| Explain homomorphism and isomorphism with their propel ci OR Theorem - Every infinite eyeie group lb Teomorphic to (24). S02 Determine the truth value ofeach of the following statements (Propositions): cos )3+5=8or241=9 44327 and5+2=7 (ill) Agra iin England or 1+9=8 | Show that p A~p isa contradiction cO3 [Show that (p Aq) > pis tautology C03 [Construct table and Show that ~(p > q)=(pA~a) C03 OR Show that CoB “(pO ge~pOaeper~q Draw a graph representing the problem of three houses and three utilities say water, gas | Coa and electricity ‘Show that a simple graph of order 4 and size 7 does not exist Coa ‘Show that the vertices of a planar graph with less than 30 edges is 4-colourable coa _ IfG=(V, E) isa (p, q) graph then show that 6 s 2q/p Qs a tautology. 3 k id) ‘Write down the difference between: 3 \ \ {)) Deterministic Finite Automata Vs Non Deterministic Finite Automata \ (W) Mealy machine vs Moore Machine: OR, te Theck the validity of the following statement: . “if 1 go to school, then | attend oll classes. If | attend all classes 9 . 5, then I get A do not get grade A and | do not fee! happy. Therefore, If do not go anaes! do not feel happy. a) Define a complete graph with an example. te) Differentiate between Euler and Wamiltonion graphR a ) Prove that ina graph G the number of vertices having an odd degree is always even. Prove Hava Gaconnected simple graph glwithout self loop and parallel edges) within s can have at most {(n-k)(n-k+}]/2 edges. diagram. ‘What is Lattice? Write down the properties of lattice. Give et that ee cena: an example of a Poset that ‘State Binomial Theorem. eo Following recurrence relation: () Using recursive method, solve the ai=a,ae3 fore 2 =a OR Sa eyRoll No CS-301 a B.E. 111 Semester (UIT) Autonomous Examination, May 2019 Discrete Structures Time : Three Hours . Maximum Marks : 105 Note: Attempt all questions. Parts a, b. ¢ of each question are compulsory consist of (3, 4, 4 marks) respectively and dande part will have an internal choice of (10 marks). All subparts ofa question should be answered at one place. \. a) Let A and B any two subsets of universal set U. then (AVB) = AO! b) Prove that i) AA(BYS)= (anByulard? ii) Ax(BOC)= (axB)a(axo) Explain various types of functions with c) Define function. . an example. d) prove bY mathematical induction: tigen aneeetl 2 ia*3s 7 +t Geant) n+l oR - PRi relat sev oft teger such that GP) it e) Risa relation on set of ne au omg ee and only if-3e* 4b = Tn’ or same integer isan equivalence relation. proa) a) b) d) scr and £ retest pach Betwe Vind she OR Ditverentiate between Euler graph and Hamiltonian graph by an example. Detine posets and lattice. What do you mean by Hasse diagram? Give any one example. : Solve the difference equation @,.2 7 2a Fo, Write short notes: (any pve) i) Binomial Theorem ii) Generati 2 Functions — ass - iii) Permutation and combination.