MTH202 Final Term Past Papers File 6

MTH202 Discrete Mathematics · Final Term Examination – Spring 2005 · Time Allowed: 150 Minutes

1. 2.

3. The duration of this examination is 150 minutes.
4. This examination is closed book, closed notes, closed neighbors.
5. Calculator is allowed.
6. Pasting the equations of math type from word file into software may cause some visibility problem, so please note that do not copy equations of math type into software from word file. Paste the equations from math type directly into software.
7. In order to get full marks do all necessary steps.

Total Questions: 11

Q1. Marks : 01

There is a full binary tree that has 10 internal vertices and 13 terminal vertices Find the probability in each case A bag contains 40 balls out of which 5 are green ,15 are black and the remaining are yellow, A ball is taken out the bag. Events happening: (i) The ball is black (ii) The ball is green (iii) The ball is not green

Q6. Marks : 01

By mathematical induction, for all integers n ≥1

n L

o

1)(2 1) n n n

o

1)(2 1) n n n

o

1)(2 1) n n n

o

1)(2 1) n n n

Q7. Marks : 01

Combination of n and k i.e. C (n, k) is equal to.

o

n C n k n k

o

n C n k k n k

o

P n k C n k n k

Q8. Marks : 01

Using the Euclidean algorithm gcd (330, 156)

o 6 o 3

o

Q9. Marks : 10

Find the 31st term of the Arithmetic sequence, if its 4th term is 7 and 8th term is 19

Q10. Marks : 01

Which is true statement

o {x} ∈{x} o ∅ ∈ {x} o {x} ∈{{x}}

Q11. Marks : 05

Determine whether the graphs A, B shown in the figures are isomorphic or not isomorphic? Give reasons.

a

d c

e b

A a

d c

e b

B