0% found this document useful (0 votes)
30 views3 pages

Or Bca April 2022

Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
30 views3 pages

Or Bca April 2022

Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

1

202901

4
C 22052 (Pages : 3) Name......................................

1
Reg. No..................................

SECOND SEMESTER (CBCSS-UG) DEGREE EXAMINATION, APRIL 2022

1
B.C.A.
BCA 2C 04—OPERATIONS RESEARCH
(2021 Admissions)
Time : Two Hours Maximum Marks : 60

Section A (Short Answer Type Questions)


Answer at least eight questions.
Each question carries 3 marks.

1
All questions can be attended.
Overall Ceiling 24.
1. What is Operations Research ?

4
2. What is the role of OR in decision-making ?
3. Write the Mathematical model of a LPP.

1
4. What do you mean by feasible region in a LPP ? What will be the shape of the feasible
region ?
5. What are slack and surplus variables ?

1
6. What do you mean by dual of a LPP ?
7. Name the three methods for obtaining initial feasible solution of a Transportation problem.
8. What are Unbalanced transportation problems ?
9. Cite any two areas where assignment technique is applied.
10. Write any two applications of Network techniques.
11. Define an Activity and an event.
12. Draw the network diagram to the following activities :

1
Activity (i, j) Time Duration
1—2 … 2

4
1—3 … 4
1—4 … 3
2—5 … 1

1
3—5 … 6
4—6 … 5
5—6 … 7

1
(8 × 3 = 24 marks)

Turn over

202901
1
202901

4
2 C 22052

Section B (Essay Type Questions)

1
Answer at least five questions.
Each question carries 5 marks.
All questions can be attended.

1
Overall Ceiling 25.
13. What are the advantages of OR ?
14. Solve graphically the following LPP :
Maximize Z = 60x1 + 40x2
subject to the constraints 2 x1 + x2 ≤ 60 ; x1 ≤ 25 ; x2 ≤ 35 ; x1 , x2 ≥ 0.
15. A company sells two types of fertilizers, one is liquid and the other is dry. The liquid
fertilizer contains 2 units of chemical A and 4 units of chemical B per jar and the dry

1
fertilizer contains 3 units of the chemicals A and B. The liquid fertilizer sells for Rs. 3 per
jar and the dry fertilizer sells for Rs. 4. A farmer requires at least 90 units of chemical A
and at least 120 units of chemical B. Formulate the problem into a LPP.

4
16. Find the initial solution of the following TP by using North-West corner rule :
D1 D2 D3 D4 Supply

1
O1 190 300 500 100 70
O2 700 300 400 600 90
O3 400 100 600 200 180

1
Demand 50 80 70 140

17. What do you mean by an Assignment problem ? Write the differences between Assignment
problems and Transportation problems.
18. Draw a network for a simple project of erection of shed works for a shed. The various
elements of project areas shown below :
Activity node Desription Pre-requisites
A … Erect site workshop —

1
B … Fence site —
C … Bend reinforcement A
D … Dig foundation B

4
E … Fabricate steel work A
F … Install concrete plant B
G … Place reinforcement C, D

1
H … Concrete foundation G, F
I … Paint steel work E
J … Erect steel work H, I

1
K … Give finishing touch J

202901
1
202901

4
3 C 22052

19. Six jobs go first over machine I and then over machine II. The order of completion of jobs

1
has no significance. The following table gives the machine times in hours for six jobs and
the two machines. Find the sequence of jobs that minimises the total elapsed time to
complete the jobs. Find the minimum time :

1
Job number : 1 2 3 4 5 6
Time on machne I : 5 9 4 7 8 6
Time on machine II : 7 4 8 3 9 5
(5 × 5 = 25 marks)
Section C (Essay Type Question)
Answer any one question.
The question carries 11 marks.

1
20. Solve the following LPP by using dual simplex method :
Minimize Z = 2x1 + 2x2
subject to the constraints :

4
2 x1 + 4 x2 ≥ 1 ; x1 + 2 x2 ≥ 1 ; 2 x1 + x2 ≥ 1 ; x1 , x2 ≥ 0.
21. Solve the following Transportation problem :

1
D1 D2 D3 D4 D5 Supply

O1 3 4 6 8 9 20

1
O2 2 10 1 5 8 30
O3 7 11 20 40 3 15
O4 2 1 9 14 16 13

Demand 40 6 8 18 6

(1 × 11 = 11 marks)

1 41
1
202901

You might also like