Scribd
Upload
88 views8 pages

Reg. No.: Q.P. Code: (11 SC 05/ 08 CA 05/18 SS 01/19 HSN 08)

The document contains details about a degree examination for Computer Science/Computer Applications/Software Systems/Hardware System and Networking. It includes a 10 question multiple choice section with questions about topics like linear programming problems, transportation problems, queueing systems, and project management. It also includes 5 short answer and 5 long answer questions covering additional topics in operations research and computer based optimization techniques.

Uploaded by

Shweta
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
88 views8 pages

Reg. No.: Q.P. Code: (11 SC 05/ 08 CA 05/18 SS 01/19 HSN 08)

The document contains details about a degree examination for Computer Science/Computer Applications/Software Systems/Hardware System and Networking. It includes a 10 question multiple choice section with questions about topics like linear programming problems, transportation problems, queueing systems, and project management. It also includes 5 short answer and 5 long answer questions covering additional topics in operations research and computer based optimization techniques.

Uploaded by

Shweta
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/ 8

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

6541 Q.P. Code : [11 SC 05/


08 CA 05/18 SS 01/19 HSN 08]

(For the candidates admitted from 2008 onwards)

B.Sc./B.C.A. DEGREE EXAMINATION, APRIL 2021.

Third/Second Semester

Part III — Computer Science/Computer


Applications/Software Systems/Hardware System and
Networking

COMPUTER BASED OPTIMIZATION TECHNIQUES

Time : Three hours Maximum : 75 marks

SECTION A — (10  1 = 10 marks)

Answer ALL the questions


Choose the correct answer :

1. Which of the following is not a static model OR?


(a) LPP
(b) Assignment problem
(c) Transportation problem
(d) Replacement problem
2. An LPP having more than one optimal solution is
said to have –––––––––– solution.
(a) multiple optimal (b) unique
(c) no solution (d) unbounded

3. Any solution to a LPP which satisfies the non -


negativity restrictions of the LPP is called its
–––––––
(a) optimal solution
(b) feasible solution
(c) unbounded solution
(d) saddle point

4. In TP, If it is impossible to increase or decrease


any allocation without either changing the
position of the allocation or violating the rim
requirements is said to be
(a) feasible solution
(b) degenerate solution
(c) independent positions
(d) dependent positions

5. The game is said to be fair if


(a) maxmin = minmax = 0
(b) maxmin > minax
(c) minmax > maxmin
(d) maxmin + minmax = 0

2 6541
6. Let Rt maintenance cost at time t, C is capital
cost and S is the scrap value then the annual cost
of the item at any time is
(a) Rt  C  S (b) Rt  C  S

(c) C  Rt  S (d) C  Rt  S

7. In steady state
(a) lim Pn' (t )  0 (b) lim Pn (t )  0
t 0 t 0

(c) lim Pn' (t )  0 (d) lim Pn (t )  0


t  t 

8. The negative exponential distribution, the mean


service rate is
1
(a) (b) 

1
(c) (d) 

9. The activity with zero total float is known as ––––


(a) optimistic (b) critical activity
(c) pessimistic (d) dummy activity

10. –––––––– is the time an activity will take if


executed under normal conditions.
(a) Optimistic time (b) Pessimistic time
(c) Must likely time (d) Crash time
3 6541
SECTION B — (5  5 = 25 marks)

Answer ALL questions.

11. (a) What are the characteristics of a good model


in operation research?
Or
(b) The following LPP graphically
Maximize z  3x1  4 x 2

Subject to x1  x 2  450;
2x1  x 2  600
and x1 , x 2  0.

12. (a) What do you mean by balanced and


unbalanced transportation problems?
Explain how would you convert the
unbalanced problem into a balanced one?
Or

(b) Solve the assignment problem


P Q R D

A 18 26 17 11

B 13 28 14 26

C 38 19 18 15

D 19 26 24 10

4 6541
13. (a) Explain how to determine whether the
individual replacement policy is better or the
group replacement policy.

Or

(b) Explain two person zero sum game and


saddle point.

14. (a) Define transient state and steady state of a


queueing system.

Or

(b) What do you understand by explosive state


of a queueing system.

15. (a) Explain the method of numbering the nodes


of an activity on arrow diagram.

Or

(b) Construct the network for the project whose


activities and their relationships are as given
below

Activities : A, D, E can start simultaneously

Relation : B, C>A; G,F>D,C; H>E,F

5 6541
SECTION C — (5  8 = 40 marks)

Answer ALL questions.

16. (a) Use Big - M method to solve

Maximize z  4 x1  3x 2

Subject to 2x1  x 2  0;

 3x1  2x 6  6; x1  x 2  6 and x1 , x 2  0.
Or
(b) Use dual simplex method to solve
Min z  4 x1  6x 2  18 x 3

Subject to x1  3x 3  3, x 2  2x 3  5

and x1 , x 2 , x 3  0 .

17. (a) Solve the following transportation problem


F1 F2 F3 Available

D1 7 3 2 2

D2 2 1 3 3

D3 3 4 6 5

Demand 4 1 5

Or

6 6541
(b) Solve the following IPP,
Max z  3x1  4 x 2

Subject to 3x1  4 x 2  8;

x1  4 x 2  10 and x1 , x 2  0, integers.

18. (a) Describe the multi - service queueing model.


Or
(b) The mean arrival rate to a service centre is 3
per hour. The mean service time is found to
be 10 minutes per service Assuming Poisson
arrival and exponential service time, find
(i) utilisation factor for this service facility
(ii) probability of 2 units in the system
(iii) expected number of units in the queue
(iv) expected time in minutes that a
customer has to spend in the system.

19. (a) The cost of a machine is Rs. 6500 and its


scrap value is Rs. 500. The maintenance
costs found from experience are as follows :
Year : 1 2 3 4 5 6 7 8
Main 100 250 400 600 900 1200 1600 2000
cost :

When should the machine be replaced?

Or

7 6541
 1 
 1 
(b) Solve the following game A  2 .
 1 0 

 2 

20. (a) Determine the critical path of the project.


Also find total, free and independent floats.
Activity : 0-1 1-2 1-3 2-4 2-5 3-4 3-6
Duration 3 8 12 6 3 3 8
(In weeks)
Activity : 4-7 5-7 6-7
Duration 5 3 8
(In weeks)

Or
(b) The three estimates for the activities of a
project are given below. Calculate the length
and variance of the critical path. What is the
probability of completing the project on or
before 22 days.
Activity a m b
1-2 5 6 7
1-3 1 1 7
1-4 2 4 12
2-5 3 6 15
3-5 1 1 1
4-6 2 2 8
5-6 1 4 7

——–––––––––
8 6541

You might also like