Madras University (UnOM) 2006 B.C.A Computer Application Quantitative Techniques - Question Paper

Time: 3 hours
Maximum: 100 marks

part A - [5 x eight = Marks 40]

ans any 5 ques..
All ques. carry equal marks.

1. a. State any 2 kinds of models used in OR

b. describe LP issue.

c. Can a Transportation issue be regarded as a special case of LP problem? Justify your ans.

d. obtain the initial b.f.s for the subsequent transportation issue by North – West corner method:

Destination
Sources D1 D2 D3 Supply
O1 two three 11 nine
O2 one nine six six
Demand seven five three

e. State Baye’s Theorem

f. describe saddle point.

g. State any two components of a network

h. Draw the network for the activities defined below: Activity A B C D E F G H
Immediate Predecessor - - A B C,D C,D E F

i. define the queuing model: (M/M/C): (&infinity;/LIFO).

j. discuss the concept : Service discipline


part B - [5 x six = Marks 30]

ans any 5 ques..
All ques. carry equal marks.

2. elaborate the advantages or OR in decision making?

3. discuss the terms: feasible solution, degenerated basic feasible solution, unbounded solution

4. obtain the saddle point, if exists:

Player B
Player A one two three four
1 0 seven five 12
2 10 11 nine 13
3 nine five seven two


5. elaborate the assumptions made in solving a project scheduling by CPM/PERT?

6. discuss the least-cost method to obtain an initial b.f.s of a transportation issue.

7. discuss Kendall’s notation for queuing models.

8. A fertilizer company distributes its products by trucks. It was obtained that on an avg. every five minutes 1 truck arrived and the avg. loading time was three minutes. Determine:

a. the probability that a truck has to wait.
b. avg. waiting time of a truck.

SECTION-C [ two x 20 = Marks 40]

ans BOTH the ques..
All ques. carry equal marks.

9. a. Solve the subsequent LP issue by graphical method:
Maximize z = 28x + 30y
Subject to:
6x + 3y = 18
3x + y = 8
4x + 5y = 30
and x,y = 0

b. Solve the subsequent transportation problem:

Destination
issue one two three four
A 11 22 six five 75
B 16 31 14 15 60
C five 21 four nine 40
30 65 55 25


10. a. Draw the network for the subsequent project:

Activity A B C D E F G
Immediate Predecessor - - - A B C D,E
Duration (Days) two four three one six five seven
calculate the critical path and float for every activity.

Or

b. Write short notes on:

i. Decision trees

ii. Time estimates used in PERT

iii. Poisson queues

iv. Balanced and unbalanced transportation

Earning:   Approval pending.