Tamil Nadu Open University (TNOU) 2008 B.B.A Quantitative methods,,e - Question Paper
This beneath ques. paper is related to quantitative methods of B.B.A.
B.B.A. DEGREE EXAMINATION JUNE 2008.
Second Year
QUANTITATIVE METHODS
Time : 3 hours Maximum marks : 75
Answer for 5 marks questions should not
exceed 2 pages.
Answer for 15 marks questions should not
exceed 5 pages.
PART A (3 5 = 15 marks)
Answer any THREE questions.
1. Discuss the various phases in solving an Operations Research Problem.
\ vmh UP a\ w Pq iP .
2. Solve the following graphically :
Maximize 
Subject to 
R E PnUP h w Ps.
Maximize
Subject to 
3. Solve the following transportation problem :
|
|
D1 |
D2 |
D3 |
D4 |
Supply |
|
O1 |
4 |
3 |
0 |
5 |
24 |
|
O2 |
1 |
2 |
6 |
1 |
17 |
|
O3 |
2 |
6 |
2 |
3 |
19 |
|
Demand |
15 |
19 |
18 |
8 |
|
R umk USzx a\ w \.
|
|
D1 |
D2 |
D3 |
D4 |
A |
|
O1 |
4 |
3 |
0 |
5 |
24 |
|
O2 |
1 |
2 |
6 |
1 |
17 |
|
O3 |
2 |
6 |
2 |
3 |
19 |
|
u |
15 |
19 |
18 |
8 |
|
4. Define a network. Explain the rules for drawing network diagram.
. h uP vP USP.
5. Explain the operating characteristics of queueing systems.
\ |h ]P USP.
PART B (4 15 = 60 marks)
Answer any FOUR questions.
6. Solve the following LPP by simplex method.
Minimize 
R PkUPmk LPP I SIMPLEX w Ps.
Minimize
7. Solve the following assignment problem :
|
|
1 |
2 |
3 |
4 |
|
A |
9 |
26 |
17 |
11 |
|
B |
13 |
28 |
4 |
26 |
|
C |
38 |
19 |
18 |
15 |
|
D |
19 |
26 |
24 |
10 |
R PkUPmk JxURmk a\ w Ps.
|
|
1 |
2 |
3 |
4 |
|
A |
9 |
26 |
17 |
11 |
|
B |
13 |
28 |
4 |
26 |
|
C |
38 |
19 |
18 |
15 |
|
D |
19 |
26 |
24 |
10 |
8. Explain the classification, solution procedure and the distributions followed by Queueing models.
\ A P, w P Au \P P UP.
9. What is critical path? What are the main objectives of CPM? Explain Critical Path Method.
wu G G? wu UQ |UP[P ? wu .
10. Construct a network diagram and find the critical path, EST and LFT for the following data :
|
Activities (i - j) : |
1-2 |
1-3 |
2-3 |
2-5 |
3-4 |
|
Duration (Dij) : |
15 |
15 |
3 |
5 |
8 |
|
Activities ( i - j) : |
3-6 |
4-5 |
4-6 |
5-6 |
6-7 |
|
Duration (Dij) : |
12 |
1 |
14 |
3 |
14 |
R [PUS nzu P. wUP u, EST LFT PnUQkP.
|
\ ( i - j) : |
1-2 |
1-3 |
2-3 |
2-5 |
3-4 |
|
| (Dij) : |
15 |
15 |
3 |
5 |
8 |
|
\ ( i - j): |
3-6 |
4-5 |
4-6 |
5-6 |
6-7 |
|
| (Dij) : |
12 |
1 |
14 |
3 |
14 |
11. Solve the following game :
Player A
|
|
A1 |
A2 |
A3 |
A4 |
|
B1 |
0 |
3 |
4 |
3 |
|
Player B B2 |
1 |
2 |
1 |
0 |
|
B3 |
3 |
7 |
0 |
2 |
R PkUPmk mk a\ w :
A
|
|
A1 |
A2 |
A3 |
A4 |
|
B1 |
0 |
3 |
4 |
3 |
|
B B2 |
1 |
2 |
1 |
0 |
|
B3 |
3 |
7 |
0 |
2 |
12. A computer service man finds that his service time is exponentially distributed with mean 30 minutes. If he gets 30 computers in a 5 day week with 8 hours per day, find the expected waiting time of the system.
J Po xh 5 |mP Psh J zvS 30 PoP, x uP Q. A | JUS 8 o | xUS \Q. \\P J Po xUP 30 {h[P uk G Cu A \\ PzvUS Pzu PnUQkP.
| Earning: Approval pending. |
