Assignment For Bmn-301
Assignment For Bmn-301
k , 2 x 2
0, elsewhere
Then the value of the constant k is
a) 1/8 b) 1/2
c) 1/4 d) 1/12.
ii) If p q ( p q ) r then r is
a) pq b) ~ p
c) q p d) ~ q .
a) 6 edges b) 4 edges
c) 5 edges d) 7 edges.
a) P ( A) 1 b) P ( A) 0
c) 0 P ( A) 1 d) None of these.
d) None of these.
vi) If a binary tree has 20 pendant vertices then the number of internal vertices of the
tree is
a) 20 b) 21
c) 23 d) 19
a) 1 2 n b) 2 n 2
c) 2 n 1 1 d) 2 n 1 .
viii) The Probability that a number selected at random from the set of numbers
1, 2, 3, 4, 5, ...100 is a cube, is
a) 1/25 b) 2/25
c) 3/25 d) 4/25.
x x
a) b)
1 x 1 x3
1 1
c) d) .
1 x 1 x2
a) mean b) median
xiii) A random variable has a Poisson distribution such that P (1) P ( 2) . Then
The S.d. of X is
a) 0 b) 2
c) 2 d) -2 .
xiv) If P ( A) 1 / 3, P ( B) 1 / 4, P ( A B) 1 / 2 then P ( B / A)
a) 3/4 b) 4/3
c) 1/4 d) 1/3 .
2. Two urns contain respectively 2 red, 3 white, and 3 red, 5 white balls. One ball is drawn at
random from the first urn and transferred into the second. A ball is now drawn from the
second urn and it turns out to be red. What is the probability that the transferred ball was
white?
4. Arrange the data in a Frequency Distribution table. Also find class mark, relative frequency
and cumulative frequency.
12 15 17 25 36 38 26 28
39 24 39 37 32 16 45 28
14 15 25 36 10 14 05 25
26 08 34 14 12 11 19 28
32 36 38 37 25 12 14 17
18 15 16 25 31 30 50 26
(~ ( p q)) ( q p ) .
c) Verify the validity of the argument “I do all exercises in this chapter, then I understand
the material. If I understand the material, then I do well on the exam. If I do well on the
exam, then I pass the examination. I pass the examination. Therefore, I do all exercises
in this chapter.”
a n 5a n 1 6a n 2 =0 where a 0 2, a 1 5 .
b) Using Kruskal’s algorithm find a spanning tree with minimum weight from the
graph given below. Also calculate total weight of spanning tree.
( n 1)
c) The number of pendant vertices in a binary tree is where n is the number of
2
vertices in the tree.
b) Let G be a bipartite graph of 22 vertices with partition sets U and W, where U consists
12 vertices. Suppose that every vertex of U has degree 2 or 3, while every vertex of W
has degree 2 or 4. How many vertices of G have degree 2?
X xi -2 -1 0 1 2 3
fi 0.15 m 0.25 2m 0.35 m
i) Find m .
ii) Evaluate P ( X 2), P( X 2) and P( 2 X 2) .
iii) Determine the distribution function F(x) of X.
1
kx , 1 x 1
f ( x) 2
0, elsewhere
1
where k is a constant, Find k and compute P( X ) . Also find E ( X ) .
2
11. a) Obtain the generating function for {1,-1,-1,1,-1,-1,…} and {1,2,3,4,5,…}.
b) Find the shortest path and minimum distance from vertex 0 to vertex 4 using
Dijkstra’ algorithm:
x: 5 10 12 16 21
y: 2 5 7 4 2
c) A car hire firm has two cars which it hires out day by day. The number of demands for
a car on each day is distributed as a with average number of demand per day 1.5.
Calculate the proportion of days on which neither car is used and the proportion of days
on which some demand is refused. (Given: e 1.5 0.2231).
END