B.Sc. (Computer Science) Sem 3 Discrete Mathematics 2014-15 Page 1 Question Paper - Mumbai University | munotes

Questions asked in this paper

1. Q1 Solve the following (any4)
   • a) Prove that any two equivalence classes are either equal or disjoint
   • b) Solve the recurrence relation , with generating function Arrange the numbers 6,7,4,5,3 in ascending order using Bubble sorting algorithm
   • d) Solve the recurrence relation with ao=5,
   • e) Write a note on Tower of Hanoi
   • f) Let arelation R defined on as aRb iff a/b then prove that (Z* /) is also poset
   • g) Define trasitive closure Let the transitive closure of R whose matrix is given by
   • h) Define the Composite relation Let B={a,b,c}, C=(xy,z}. Let from A to from B to C. Find sor -Also verify M
2. Q2 Solve the following (any 4) 20 marks
   • a) Define a tree on 5 vertices with a suitable example Perform a preorder ,postorder and Inorder on the following tree
   • b) Define i) ordered rooted tree
   • ii) linked list representation using vertex and edge file

Read from the scan above, so a character or two may differ. The scan is the original.