M.B.A. DEGREE EXAMINATION,
NOVEMBER 2017
First Semester
QUANTITATIVE METHODS
(CBCS 2016 onwards)
Time 3 Hours Maximum 75 Marks
Part A x 3 15)
Answer all questions.
All questions carry equal marks.
1. How linear programming is useful for decision making?
2. What are the properties of Binomial distribution?
3. Explain the basic concepts of Queuing theory.
4. What are the criteria for decision?
5. Explain the terms marginal cost and marginal revenue.
Part B 10 50)
Answer all questions, choosing either or
All questions carry equal marks.
6. A cement factory manager is considering the best
way to transport cement from three manufacturing
centres to deposit and E The weekly
productions and demands along transportation costs
per tonne are given below:
Sub. Code
643106
RW-808
2
Wk 3
A B C D E Tonnes
P 4 1 3 4 4 60
Q 2 3 2 2 3 35
R 3 5 2 4 4 40
22 45 20 18 20 135
What should be the distribution programme?
7. A sample of 3 items is selected at random from a
box containing 12 items of which 3 are defective.
Find the possible number of defective combinations
of the said selected items along with probability of a
defective combination.
Or
Suppose that a manufactured product has 2 defects
per unit of product inspected. Using Poisson
distribution, calculate the probabilities of finding a
product without any defect, 3 defects and 4
defects.(Given e-2 0.135)
8. Explain the simulation method of queuing models.
Or
RW-808
3
Wk 3
At one-man book binding centre, customers arrive
according to Poisson distribution with mean arrival
rate of 4 per hour and the book binding time is
exponentially distributed with an average of
12 minutes. Find out the following: The average
number of customers in the book binding centre and
the average number of customers waiting for book
binding. The percentage of time arrival can walk in
straight without having to wait. The percentage of
customers who have to wait before getting into the
book binder's table.
9. Solve the game with the following pay-off matrix.
Player Y strategies
I II III IV V
1 9 12 7 14 26
2 25 35 20 28 30
3 7 6 3 2
Player X
Strategies
4 8 11 13 1
Or
Consider the following two machines and six
jobs-flow shop scheduling problem
Jobs 1 2 3 4 5 6
Machine 1 4 10 14 8 18 16
Machine 2 6 12 10 12 6 8
Find the sequence of the jobs which will
minimize the makespan
Find the corresponding optimal makespan.
10. From the following data obtain the regression
equations:
X 6 2 10 4 8
Y 9 11 5 8 7
Or
RW-808
4
Wk 3
From the following table calculate the co efficient of
correlation by Karl Pearsons method:
A 6 2 10 4 8
B 9 11 8 7
Arithmetic mean of A and B series are 6 and 8
respectively.
Part C 10 10)
(Compulsory)
11. Activity Preceding Optimistic Most likely Pessimistic
Activity time time time
in weeks in weeks in weeks
A 2 4 12
B 10 12 26
C A 8 9 10
D A 10 15 20
E A 7 7.5 11
F B,C 9 9 9
G D 3 3.5 7
H 5 5 5
Answer the following questions.
Find probability of project completion in 32 weeks.
Find probability of project completion in 27 weeks.
Find project completion time for 95% probability.
Find probability of not completing project in
30 weeks.
————————