ae Reg. No. ? Q.P. Code : [21 SC 05] 2030 (For the candidates admitted from 2021 onwards) B.Sc. DEGREE EXAMINATION, MAY 2023. econd Semester Part II] — Computer Scien B.C.A,/Information ‘Technology/Computer Technology/Multimedia and Web Technology/Hardware System and Networking/Computer Science and Application Allied — DISCRETE MATHEMATICS Time : Three hours Maximum : 50 marks SECTION A — (10 x 1= 10 marks) Answer ALL questions. Choose the correct answer : Let A and B be two sets such that n(A)=16, n(B)=14, n(Av B)=25 then n(A- B)= (a) 30 (b) 50 () 5 55_ For any two sets A and B, AM (AUB) (a) A (b) B © ¢ @) ANB’ [(p > a), ~ q] is tautologically imply e (@) p yg © @ a) ~P 2. —— is true If p and q are two statements statement when either p or q is true but not both and vice versa @ p>4 (b) p@q © pta (@) pla If either A or B is infinite and other is not empty then A x Bis (a) ¢ (b) finite (c) infinite @) AUB If A and B are two non-empty sets having 7 elements in common, then A x B and B x A have elements in common. (a) n (b) 2n © 2 @ 2» )10, is an identity element for concatenation operation on an alphabet © (a) A (b) e @ ¢ @) 1 Which of the following is not correct for the regular expression (a) gr=rd=¢ () rt+r=r (©) g+r=¢ @orrer of vertex one 1S In a graph G(V,E), deg called (a) Isolated Vertex (b) Pendant Vertex (c) Cut Vertex (d) Pseudo Vertex A simple graph G with n vertices has more than edges, then G is connected 1 1 : (a) ane 1) (b) 2 Ye-2) (© n(r-1) (@) (n-1)(n-2) SECTION B — (5 x 3= 15 marks) Answer ALL questions. (a) Prove that A-(4-B)=(AnB) Or (b) Show that union is distributive over intersection in set theory. 3 203012. 13. 14. 15. a) (b) (a) (b) (a) (b) (a) (b) Show that the connective J is commutative but not associative. Or If p and q are two logical statements construct truth table for (p T-q r), Show that'the relation < defined on the set of positive mtegers is a partial order relation. Or If R and S are relations from A to B prove that (RAS)'=RI 9ng7. Let L={b,a*} be a language over the alphabet ¥ = {a,b}. Then find Z°, 12,1. Or Explain the Backus-Naur form with example. Show that-a simple graph G when n vertices and k components can not have more than zt ~k\n—k+1) edges. Or Défine an isomorphic graph with examples 4 2030 “ —at ta ea aan ial (b) SECTION C (6x5 25 marks) Answer ALL questions A TV survey shows that 60 percent people see program A, 50 percent see program B. 50 percent see program C, 30 percent see program A and B, 20 percent see program B and C, 30 percent see program A and C. and 10 percent do not see any program Find (i) What percent see program A, B and C? (ii) What percent see exactly two programs? (iii) What percent see program A alone? Or Show that for any three sets An(B®@C)=(ANB)®(AnC) If p and q are two statements, then show that (p ®q)v (p + q) is equivalent to (pt q) Or Establish #As can be derived from the premises (p => q), q=>~r,r, p\ (as) 5 203018. (a) Let f:X—>Y and g:Y—Z be any two one-one and onto invertible functions. Then Show that go/fis also one-one and onto function Or (b) Let R be the relation on the set of ordered pairs of positive integers such that (a,b), (¢,d))e R if and only if ad=be. Show that R is an equivalence relation. 19. (a) Find the phrase structure grammar that generate the language L = ja"b” Or (6) Design a finite state machine M where the input set is {01,2} and output set contains digits which are modulo 3 sums of the digits in the input sequence. 1 in2ly 20. (a) Show that the maximum number of edges in a complete bipartite graph with n vertices are — Or } (b) Draw the expression tree for the following expression and hence write prefix and postfix form of the expression (x +2)? 3)s(y-(8+x))-5. 6 2030Reg. No. : Pdead Dress 6752 Q.P. Code : [21 SC 05) (For the candidates admitted from 2021 onwards) B.Sc. DEGREE EXAMINATION, JUNE 2022. Second Semester Part III — Computer Science Allied - DISCRETE MATHEMATICS Time : Three hours Maximum : 50 marks SECTION A — (10 x 1 = 10 marks) Answer ALL questions. Choose the correct answer : 1. Which of the following is correct? (a) 0e¢ >) ge {0} f © ‘e9 @ 9fo} 2. Which of the following is not correct? (@) AnU=A ) AU(AnB)=B © Avug=A @) AvuU=U| Which of these sentences is a proposition? a. (a) 5+7=10 (b) There is no pollution in Chennai (c) What time is it? (@) 44+x=5 9. p= (p= 4Q) is equivalent to , @ Pp (b) p>q © 4 @ aq=>p A relation on the set A is said to be ————~ if R=AxA (a) Identity relation (b) Void relation (c) Universal relation (d) Reflexive relation A finite set A with n elements. How mi relations are on A are reflexive relations on A @ (b) 2" O) @ 2 Which of the following is not correct? (a) concatenation operation is commutative (b) concatenation operation is associative (©) |p| #|LaLa| (@)— \LaLa| <|L4\ [Lal N A—m_—" °»°~°»~»~»~ © following is not correct? ne 8. Which of the @ |l=° () {4 @ 4¢€= @) lAlee 9. Ina graph par of nodes that are joined by more than one edge are called (a) adjacent edges (b) Loop (© parallel edges (@) Pseudo edges 10. Path that does not involve a repeated edge is os called ion (a) circuit (b) bridge relation (© open walk (a) trail ae SECTION B — (6 x 3 = 15 marks) sonA Answer ALL questions. i. (a) Prove thatA®(4qB)=A-B Or tative 5 : (b) Show that intersection is distributive over ative union in set Theory. 3 675212. 13. 14, 15. (a) (b) (a) (b) (a) (b) (a) (b) Prove that conditional operation distributiy, over conjunction. . Or If p, q and r are three logical statement, then show that [(p > q)a (q=>r)|= (p > r) Show that the relation < (subset) defined oy the power set P(A) of the set A is a Partial order relation Or If Rand S are equivalence relations on a set A, Prove that: (RUS)! =R?US* Let L, = fa, ab, o*} and I, = 'b? aba} be two languages over the alphabet © = {a,b}. Then| find out L,Z, and Li. Or Explain the different types of grammars. Explain the Representation of graphs computer memory. Or Define path, cycles and connectivity of graph with examples. 4 675)tributive ements, D=>r) fined on Partial on a set hs of 675 (a) ) a) () SECTION C —(5 x5 =25 marks) Answer ALL, questions, In a survey concerning using cert, of consumers, It was found ee brand A, 50% use brand B, 42% use bende: 28% use A and B, 20% use A and 0, 13% tae Band C and 10% use all the three brands. ( What percentage do not use any of the brands? (ii) What percentage use exactly two brands? Or Show that for any three sets Ax(BUC)=(Ax B)U(AxC) Show that ~qa(p=> q) _ tautologically imply ~p. Or Establish ~p is the valid conclusion from the arguments ~ (pa = q),~ her. Let {:X—Y and g:Y—>Z be any two invertible functions. Then show that (gefJ'=fieg". Or Show that the relation R “congruent modulo m” is an equivalence relation on the set of integers. Where m is a positive integer greater than 1. 5 675219. 20. (a) (b) (a) b) Consider the language L= forapn inh Find grammar G which generaté L. } Or Design a finite state automaton M tha accepts those strings from © = {a, b} which have even number of ‘a’. Prove that every tree T' with at least twa vertices has at least two pendent vertices. Or Draw the expression tree for the following expression and hence write prefix and postfix form of the expressio: (a+b)*c)t (e+ f)*a)- SS