Scribd
Upload
29 views4 pages

BCA (Operation Researches) 2021

The document outlines an examination paper for a Computer Application course focusing on Operations Research, detailing various questions across multiple units. It covers topics such as the advantages and disadvantages of operations research models, the duality theorem, transportation problems, and project management techniques like PERT and CPM. The paper includes specific mathematical problems and theoretical questions designed to assess students' understanding of operations research principles.

Uploaded by

Blezar Mrong Marak
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
29 views4 pages

BCA (Operation Researches) 2021

The document outlines an examination paper for a Computer Application course focusing on Operations Research, detailing various questions across multiple units. It covers topics such as the advantages and disadvantages of operations research models, the duality theorem, transportation problems, and project management techniques like PERT and CPM. The paper includes specific mathematical problems and theoretical questions designed to assess students' understanding of operations research principles.

Uploaded by

Blezar Mrong Marak
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/ 4

6/H–80 (xv) (c) (Syllabus–2015) ( 2 )

2021 2. (a) What are the advantages and


( July ) disadvantages of operations research
models? Why is it necessary to test
models and how would you go about
COMPUTER APPLICATION
testing a model? 5+3=8
( Honours )
(b) Explain the steps involved in the
( Operations Research ) solution of an operations research
problem. 7
[ BCA–602 (c) ]

Marks : 75
UNIT—II
Time : 3 hours

The figures in the margin indicate full marks 3. (a) State the fundamental theorem of
for the questions duality. 2

Answer one question from each Unit (b) Obtain the solution by solving its dual : 8
Maximize Z = 3x1 + 2x 2
UNIT—I subject to the constraints

1. (a) Briefly trace the history of operations x1 + x 2 ³ 1


research. What happened to the x1 + x 2 £ 7
development of operations research x1 + 2x 2 £ 10
after World War–II? 3+5=8 x2 £ 3
(b) Operations research is an ongoing x1, x 2 ³ 0
process. Explain this statement with
examples. 4
(c) State and prove complementary
(c) What is the role of operations research slackness theorem. 5
in decision making? 3

20D/1345 ( Turn Over ) 20D/1345 ( Continued )


( 3 ) ( 4 )

4. (a) Define surplus variable and artificial (b) Obtain an initial basic feasible solution
variable. 3 to the following transportation problem
(b) Explain the advantages of the using the least cost rule : 5
two-phase method over the big-M
method. 2 D1 D2 D3

(c) Solve the following using two-phase S1 1 2 6 7


simplex method : 10 S2 8 4 2 12
Maximize Z = 5x1 + 8x 2 S3 3 7 5 11
subject to the constraints 10 10 10
3x1 + 2x 2 ³ 3
x1 + 4x 2 ³ 4
6. (a) Briefly describe the different methods of
x1 + x 2 £ 5
obtaining an initial solution of a given
x1, x 2 ³ 0
transportation problem. 7

UNIT—III (b) Solve the following transportation


problem to maximize the total profit (the
5. (a) Find an initial basic feasible solution to entries denote profits from sale of unit
the following transportation problem product) : 8
using North-West corner rule : 10

D1 D2 D3 Availability Market
M1 M2 M3 M4 Supply
O1 2 7 4 5 S1 15 51 42 33 23
O2 3 3 1 8 Source S2 80 42 26 81 44
Origin O3 5 4 7 7 S3 90 40 66 60 33
O4 1 6 2 14 Demand 23 31 16 30 100 Balanced
Requirements 7 9 18 34

20D/1345 ( Turn Over ) 20D/1345 ( Continued )


( 5 ) ( 6 )

UNIT—IV (b) Solve the following using the LPP


method : 8
7. (a) Solve the following game with the
pay-off matrix : 3 A

B1 B2 B3 B4 æ -1 2 1ö
ç ÷
B ç 1 -2 2÷
A1 1 7 3 4 ç 3 4 -3÷ø
è
A2 5 6 4 5
A3 7 2 0 3

(b) Solve the following game : 6 UNIT—V

B1 B 2 9. (a) Explain the following terms in


A1 æ 8 -3ö PERT/CPM : 2×5=10
ç ÷
A 2 è -3 1ø
(i) Earliest time
(c) Solve the following game using the (ii) Latest time
graphical method : 6
(iii) Total activity time
B1 B 2 B 3 B 4
(iv) Even slack
A1 æ 2 2 3 -2ö
ç ÷ (v) Critical path
A 2 è4 3 2 6ø
(b) State the circumstances where CPM is a
8. (a) Solve the game better technique of project management
A than PERT. 5
æ -1 2 1ö
ç ÷
B ç 1 -2 2÷
ç 3 4 -3÷ø
10. (a) Show that the probability of the number
è
of customers in the system is greater
applying algebraic method. 7 than or equal to n. 4

20D/1345 ( Turn Over ) 20D/1345 ( Continued )


( 7 )

(b) In a store with one server, 9 customers


arrive on an average of 5 minutes.
Service is done for ten customers in five
minutes. Find—
(i) the average number of customers in
the system;
(ii) the average queue length;
(iii) the average time a customer spends
in the store;
(iv) the average time a customer waits
before being served. 2×4=8
(c) Explain the distinction between
transient and steady states. 3

HHH

20D—PDF/1345 6/H–80 (xv) (c) (Syllabus–2015)

You might also like