21U667 (Pages: 3) Name: …………………….

Reg. No: ………………….

SIXTH SEMESTER B.B.A. DEGREE EXAMINATION, APRIL 2024
(CBCSS - UG)
(Regular/Supplementary/Improvement)
CC19U BBA6 B13 – MANAGEMENT SCIENCE
(B.B.A. - Core Course)
(2019 Admission onwards)
Time: 2.5 Hours Maximum: 80 Marks
Credit: 4
Part A (Short answer questions)
Answer all questions. Each question carries 2 marks.
1. What is the methodology of OR?
2. What is a constraint?
3. List out any two disadvantages of L.P.P.
4. State the purposes of network analysis
5. Determine the various uses of network techniques for management.
6. Represent successor activity graphically.
7. What is meant by PERT?
8. Discuss any two advantages of PERT and CPM.
9. What do you mean by decision theory?
10. State the meaning of pay off.
11. Discuss Laplace criterion.
12. What is Expected Value of Perfect Information (EVPI)?
13. State any four assumptions of a game.
14. State the meaning of basic feasible solution under transportation problem.
15. Write a note on North West Corner Rule.
(Ceiling: 25 Marks)
Part B (Paragraph questions)
Answer all questions. Each question carries 5 marks.
16. What is the nature of OR?
17. What are the types of models commonly used in OR?
18. Solve graphically.
Maximise Z= 22X₁ + 18X₂
Subject to 3X₁ + 2X₂ ≤ 48
X₁ + X₂ ≤ 20
X₁ ≥ 0, X₂ ≥ 0
(1) Turn Over
19. A project consists of six activities (jobs) designated from A to F, with the following 21U667
relationships. Cost of a copy is 3 Rs. and sale price is 5 Rs. He cannot return magazine but each for one
(i) A is the first job to be performed Rupee only. Prepare pay off table. How many copies should he order? Also find Expected
(ii) B and C can be done concurrently, and must follow A number of sales.
(iii) B must precede D 26. A project schedule has the following characteristics.
(iv) E must succeed C but it cannot start until B is completed Activity Time Activity Time
(v) The last operation F is dependent on the completion of D & E 1-2 4 5-6 4
Draw the network diagram 1-3 1 5-7 8
20. Explain the differences between Maximax and Minimax criterion. 2-4 1 6-8 1
21. Discuss Decision tree theory in detail. 3-4 1 7-8 2
22. Find the initial feasible solution to the following transportation problem solved by lowest cost 3-5 6 8-10 5
entry method 4-9 5 9-10 7
W₁ W2 W₃ (1) Construct network diagram
F1 2 7 4 5 (2) Compute TE and T₁ for each event
F2 3 3 1 8 (3) Find EST, LST, EFT and LFT values of all activities
F3 5 4 7 7 (4) Find critical path and project duration
F4 1 6 2 14 27. The following table shows all the necessary information on the available supply to each
7 9 18 warehouse, the requirement of each market and the unit transportation cost from each
23. Solve the following Transportation problem to maximise profit. warehouse to each market. Use test of optimality
Profit in Rs/Unit Distribution Warehouse
. A B C D Supply . Ⅰ Ⅱ Ⅲ Ⅳ V Capacity
1 15 51 42 33 23 A 6 4 4 7 5 100
Source 2 80 42 26 81 44 Shop B 5 6 7 4 8 125
3 90 40 66 60 33 C 3 4 6 3 4 175
Demand 23 31 16 30 Required: 60 80 85 105 70
(Ceiling: 35 Marks) The cost of manufacture of the product at different production shop are
Part C (Essay questions) Shop Variable Cost Fixed Cost
Answer any two questions. Each question carries 10 marks.
A 14 7000
24. What is linear programming? Explain its applications in industry and management. B 16 4000
25. A newspaper boy has the following probability of selling magazine. C 15 5000
No. of copies sold Probability Find the optimum quantity to be supplied from each shop to different ware houses at
10 .1 minimum total cost.
11 .3 (2 × 10 = 20 Marks)
12 .4
*******
13 .2
(3)