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

Questions asked in this paper

1. Q1 Solve the recurrence rela i lation with using generating function On Tower of Hanoi g Warshall’s algorithm find the transitive closure of R whose matrix Let a relation R defined of Z” as aRbiff a/b then prove that is also poset
   • g) Define the Composite relation Let A={1,2,3}, B={a,b,c}, C={x,y,z}. Let from A to B and from B to C. Find verify M
   • h) Solve the recurrence relation with
2. Q2 Solve the following (any 4) Perform a postorder search on the following tree using postorder search algorithm Define i) ordered rooted tree linked list representation using vertex and edge file
   • c) Write the Breadth First Search algorithm. Apply it on the following graph starting with vertex

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