Download as pdf
Download as pdf
You are on page 1of 11
This question paper contains 8+3 printed pag Your Roll Now... 2142 B.Se.(Hons./H1 Cc MATHEMATICS— Paper XII (ii) (Discrete Mathematics) (Admissions of 2009 and onwards) Time . 3 Hours Maximum Marks : 75 Ot rite your Roll Nu on the top immediately on receipt of this question papers All sux questions are compulsory. ‘ Do any oe parts from each question. 1 (a) Let P and Q be ordered sets. Prove that (a,, by) (az, by) in P * Q if and only if (a; = ay and by —« by) or (6, = by and ay —« ay), 6 (5) (i) Let P be an ordered set and x, » @ P. Prove that the following are equivalent : PTO. m {c) (2) (ii) (ii) (2) 2142 1, Lx c 4 a IL (Qe OPNPye QarxreQ Draw the diagram of M; * 2, where 2 denotes chain of two elements. . 4,2 Let # be a monomorphism from the lattice L into the lattice M. Show that L is isomorphic to a sublattice of M. Let P be an ordered set and S, T c P. Assume that VS, vT, aS and AT exist in’P, Prove that if S c T, then vS < vT and AS 2 aT. 4,2 Let B be a Boolean algebra. Prove that an ideal M in B is maximal if and only if for any 6 ¢ B, either 6 € M or 6 & M, but not both, hold. 6% (4) fe) a a () Find the conjunctive normal form of Cyt sy a) Gyary Fay gy Let Lobe a lattice. Prove that the following are equivalent: (D)(¥a bce L)aalthve)- (aab)vlaacy (Diep gre Lypylger)= (pygatpyr). 3%3 Use Karnaugh diagram to simplify the following polynomial : PO (Xt XQ, + X3) + xy xy x Determine the symbolic representation of the circuit given by : PAN RY Gy! + (ey xg )Ory! + 1) using six gates 343 PTO. 3. fe) (4) 2142 a Define subgraph of a given graph. For each of the graphs below. draw pictures of the subgraphs Gsteh GV GE. GY tub (a) (i) Show that the following graphs are isomorphic : (3) 2142 (A) we o (6) Find the adjacency matrices A, and A, of the graphs G, and G, gisen below. Find a permutation matrix *P’ such that A, - PA,PT. 6 Vv; Ma Vi vy uw ug un u PTO. ( 6 ) 2142 fe) Apply first form of Dijkstra’s algorithm to find the shortest path from A to E in the following graph. Write Steps. 6 (a) Let A be the adjacency matrix of the digraph : 6 ( i 2. 3 it) Find A: (0) te) (7) 2142 (ii) Ts the digraph strongly connected ? Lxplain. (ai) Is the digraph Eulerian ? Explain. Prove that a tree with more than one vertex has at least two leaves. Hence prove that any edge added to a tree must produce a cycle. 6 Solve the Chinese Posiman problem for the following graph : 6 PT.O. ( S } 2142 (a) Let G be w connected planar graph with V > 3 vertices and f. edges. Then prove that E < 3V — 6. Hence show that Ky 1s not planar, 64 (6) Gi) Compute 4(G) for the graph shown. Explain your answer and exhibit a 7(G) coloring. (i) Is 4K,,,) the minimum of m and a ? Give reasons 42h ( 9 ) 2142 (c) Find the maximum flow for the network shown and verify the answer by finding a cut whose capacity equals the value of the flow. O% 6 (a) () Define S'a, Va and Aa . For the numeric function ‘a’ given by 0, O

You might also like