8

78159

6
C 4353 (Pages : 4) Name.....................................

3
Reg. No.................................

SECOND SEMESTER (CBCSS—UG) DEGREE EXAMINATION

1
B.C.A.
BCA 2C 04—OPERATIONS RESEARCH

Time : Two Hours Maximum : 60 Marks

Section A (Short Answer Type Questions)

Answer at least eight questions.

8
Each question carries 3 marks.
All questions can be attended.
Overall Ceiling 24.

6
1. Write any two applications of OR ?
2. What do you mean by an objective function of an LPP ?

3
3. What are the basic assumptions of a LPP ?
4. What do you mean by an artificial variable ?
5. What do you mean by basic feasible solution of a Transportation problem ?

1
6. What are Assignment problems ?
7. Define Travelling salesman problem.
8. What do you mean by Degeneracy in a TP ?
9. What is network analysis ?
10. What is meant by a Critical path ? Why should we know which activities are critical ?
11. What is dummy activity ?

8
12. Distinguish between 'Slack' and ‘float’.
(8 × 3 = 24 marks)

6
Section B (Short Essay Type Questions)

Answer at least five questions.

3
Each question carries 5 marks.
All questions can be attended.
Overall Ceiling 25.

1
13. What are the limitations of OR ?
Turn over

78159
 8
78159

6
2 C 4353

14. Solve Graphically :

3
Maximizes = 3x1 + 5x2

subjected to x1 + 2x2 ≤ 2000 ;

1
x1 + x2 ≤ 1500 ;

x2 ≤ 600 ;

x1, x2 ≥ 0.

15. A manufacturer of furniture makes two products, chairs and tables. Processing of these products is
done on two machines A and B. A chair requires 2 hours on machine A and 6 hours on machine B.

8
A table requires 5 hours on machine and no time on machine B. There are 16 hours of time per day
available on machine A and 30 hours on machine B. Profit gained by the manufacturer from a

6
chair is Re. 1 and from a table is Rs. 5 respectively. Formulate the problem into a LPP in order to
maximise the total profit ?

3
16. Find the initial solution of the following TP by using Lowest cost entry method :

D1 D2 D3 Supply

1
O1 2 7 4 5

O2 3 3 1 8

O3 5 4 7 7

O4 1 6 2 14

8
Demand 7 9 18

17. Find the optimal solution to the following Assignment problem showing the cost for assigning

6
workers to jobs :

x y z

3
18 17 16 
Workers 15 13 14  .
19 20 21

1
78159
 8
78159

6
3 C 4353

18. Draw a network diagram to the following set of activities :

3
Activities Preceeding activities

A ----------

1
B ----------

C A

D A

E B and C

F B and C

8
G B and C

H D and E

6
I F

J F

3
K G

L H and I

1
M H and I

N J, K and L

19. Distinguish between PERT and CPM.

(5 × 5 = 25 marks)

Section C

Answer any one question.

8
The question carries 11 marks.

20. Solve the following LPP by using Two-phase simplex method :

6
Maximize Z = 5x1 + 8x2

subjected to : 3x1 + 2x2 ≥ 3

3
x1 + 4 x2 ≥ 4

x1 + x2 ≤ 5

1
x1 , x2 ≥ 0.
Turn over

78159
 8
78159

6
4 C 4353

3
21. Solve the following minimal assignment problems :

I II III IV V

1
A 1 3 2 3 6

B 2 4 3 1 5

C 5 6 3 4 6

D 3 1 4 2 2

8
E 1 5 6 5 4

6
(1 × 11 = 11 marks)

1 3
3 68
1
78159