ta) (©) Prove that the maximum nuriber of nodes in a binary tree of depth d is 24-1 where d= 1. ¥ (©) Define the following : 5 @ Homomorphic graphs (i) Isomorphic graphs ‘i (a) Consider an algebraic system (Q, +) where Q is the set of rational nos. and + isa bianry operation defined by: aebeatb~ab Determine whether (Q, +) is a group. 10 (©)_Let (A,4) be a semigroup. Show that : 10 (@ for every cin Aara=a Gi) for every a,b in A,aebsa=a 8. White short notes on the following » (a) Automorphism (b) Abelian group (©) Normal subgroup @ Rings (©) Integral domain: 7872004, 800 Total No, of Otegions : 8} {Total No. of Print 478/2004 B.E. (Third Semester) EXAMINATION, M (Computer Engg.) DISCRETE STRUCTURES (CSE-201-©) Time : Thred Hour | [ Masinnun Note : Attempt any five questions 1 G@) Let 2,3, 4,5, 10,6,7,8,9) A= (123.4) B= {5,6,7,8) c= 19,10) D= (135,79) Find (he following subsets of U : @ aus @ s@D Gi) &-D, Wang © (cuvy ©) @ Given that (Angs@n@ (And s@No Show that As B. i itil iil lalate@ ) © @ wy @) (21 478/204 (j) Give an example of sets such that for three sets A, Band, AGB, Be Cand AGC. Let R be a binary relation on the set of all strings of Os and Ls such that R = {(a,8) |e and b are strings that have same number of Os). Is R reflexive ? Symmetric ? Antisymmetric ? Transitive ? 8 Confirm or disprove the following identities: 6 (AUB) x (CUD) =(AXQUBXD) (AB) x (COD) =(Ax@BxD) Prove that if f:X*Y and g:¥>Z be ‘two ‘one-to-one onto function, then gof is also one-to-one onto function. 6 Let 4a, + Cy, + Cg, g =F, E2 be a second ofder linear recurrence with constant coefficients. For some boundary cuaditions ag and ay, the solution.of the reeurrence is > 10 1a 2r eso Find 29,4), Cy, CaO Solve the following recurrence relations 10 dy = 0,0, = 3 0 given that a= 1,0 =6 Solve the recurrence relation 10 p= Oya On 2 given that a,=:2,a=3,a9=0 by method of {generating functions 13] a8) (b) Find the total set of the following recurrence rela @ a 42- 2a yr be aarts i) 4,-0.1 ~ 64, -30 2 S. (a) Find the shortest path afd shortest distance be! the vertices a and 2 using Dijstra’s algorithm : (©) Define Planar groups with examples. Prove th any ednnected graph which is planar, V—e + where V,¢ rare the number of vertices, edges, r of the graph. 6. (a) Draw the unique binary rce when the following is. Tnorder Preorder a > h