University of Mumbai 2005 M.Sc Information Technology Computer Silation and Modelling _
k-'
VENKATTESH. B. IYER
B. N. Bandodkar. College {07-09 Batch)
k-'
PD2022 [ Eotnl Marks 75
5.
( ? )
N, D,: I, Attempt any I:IVE questions but not more ilmn TH:>E questions from cry section.
2. Answers to the two sections must be written in gepiYnUg answer cooks and should be. submitted separately. v
3. Figures to the right indicate full marks. hadi question is of Jf> marks.
3. I .'se of r.on-prograinmebls calctiiatc: is r;! lowed ir: the: Examination Hnii.
5. Use ivivlom numbers provM-d in printed sheet only (generated horizontally), .
Scction -,i
Mention steps involved ir. modeling a computerized simulation iludy?
Mention the important steps to simulate the following problem on computer using C program or Excc- C".remands. , , . . '
A bread vendor buys wery morning loaves of bread at Rs. G.75/- each by placing his order one day in advancc tat the time of receiving his previous order) end sell them si R5.1.70/- each of fresh bread and Rs.0,50/- each Gf one day ole!'bread. Unsold bread can lie treated us of no values. The pattern of demand for brcad is given below: , . .
| ||||||||||||||||||||||||||||
|
'*" Vv'* r '.V1 *+J > | ||||||||||||||||||||||||||||
The vendor adopts the. follo wing order rule., If there is no Ftock with him at the end of the previous day, he orders 55 units!' Otherwise the oH.ers 51 or 53 whichever is nearest ihc uctuid fresh bread on the previous day/'' Sorting with zero slock and a pending order for 53 loaves simulate for 10 days and calculate the venders profits. . 1 -
* on
70.
\V
b.
2. 2. a. What arc the areas of application of simulation?' " --
b. Expl.'tm along with the assumption to write *C* Program to simulate on computer . the following game between two players {called the gnmc of matching coins). Two
players simultaneously flip a coin each. If both sides arc same (both heads or both utils) player A wins Rs 10;~ from fi. o', tier wise B wins Rs '0 from A.'Bach player starts with Rs. 100/- the amc should be coitiuued either 10 times or before any one of llic broke. Who is benefited i>. a simulated run of 10?
-/
r
3. a. Consider a (jroeeiy store with one check out.counter, construct'the snap shot or otherwise the algorithm for iivin the performance measures i) average waiting lime, ii) probability that a customer ha? to wait, ii!) probability of idle server, iv) averse scrvicc lime oT simulated sit..ti. n till the clock readies to "iO. iriui; the iniur arrival and service times givc-i! be low ;n the order shown, *
Infer<*rrK;;l times i,5. 6,3. y _
Service.fiwie3.5A 1.5 ~~ ---------
\ I b. fh'n'fte (ecdrfTes 0prmut*fW> police
7
2 VENKATTESH. B. IYER
B. N, Bandodkar. College (07-09 Batch) Explain the ptjeedure hence or otherwise give the code to apply chi square ,.- check whcilv t sequels of 50 random r.utr.bsre given below arc ynifffflp J distributed or.ict. Use 59/c level of significance for the chi square tcsi. Consider class interval:- namely (0, 0.20). (0.20,0.40), (0.40. 0.60), (0.60. O.SiO), (Ci.iiO, U
|
...... * " --------; B random vnrintc followiri; | | |||||||||||||||||||||||||||||||||||||||||||||||||
|
triangular dist.iHution as gi'-'cn below. | ||||||||||||||||||||||||||||||||||||||||||||||||||
. 030, 0.16, 0.18. 0.91, 0.53, 0.5s; 0.29, 0.SS, 0.?1,
0.29,
0.32,
0.47.
0.86.
 |
,r! svi |
, 0<x<J , / <x <2 , otherwise 1
f(x)
*X
0
.. . i < . . Under which situation ie
A productionprocess'manufactures computer chips on the average at'2% nonconforming. Evory day a random sample of size 50 is taken from the process. If tilt sample contains more than two nonconforming chips, the process will be stopped.
. . j) Determine the probability ihat i'ne process is stopped by the sampling scheme, iiflf the sk.-.ple .-ize altered to 30 whether the pro-ess to slopping probability i: increase or ticcrciscd -
t t , ' .
b Justify the need o.'caiibrat'en and validation in a.simulalian '-.ode! building. '
- 1 ; \ " * ,
OR ! : >'"
-O Ihj.
'5. a.
: > ', . , v
* . r *
Tui the inventory model two different -maximum inventory level <V - the leng'I of the cycle) policies i i terms effect on expected average tom' cosi yields - month for 120 first months operation, where initial inventor; !:vc! is f'n policy (20, 40) and second policy (0, Z0) X(j denotes total average cost per.mon:! of policy / on the ih inilcKcndnt replication. Using i lest, conclude whether polk 2 is s'jp"'5';: !o po1 iy I. Also obtain V0% confidence limit in say pj differ? fro.'
M3- . .. '
a.
|
' |
x |
1 |
|
1 |
126.97 |
118.15 |
|
2 |
124.31 |
120.22 |
|
3 |
126.-55 |
122.24 |
|
A |
123.32 |
120.89 |
|
5 |
127.23 188.95 | |
Do you know any modified approach to test when pair up observation of l' systems is not available?
b. Mention in details nbom any ease study in the nren cf computerized simulation.
VENKA1TESH. B. IYER
* B. N. Bandodkar. College {07-09 Batch) T" fv j '
Section II . '
'U>? 11 !:li=t and explain the properties of data that lavor centralizing objects. 1
xplam in dcuii'. \\iz f'OM Interlace' Definition Language *
OR
b a. Whm arc the different acmauon mo(i-:Is lo bnu CON: objects into memory? Explain in-prnrcss activation in detail.
Explain the relationship among the EJ13 server, container and bean.
What is JN1? What are the situations when JNI can be used? 7
. : . 8 \< >b Write and explain the various rules of IUnknown.
OR
, to Explain the concept of Subs and Skeletons in CORBA with the help ol 7 expropriate diagram.
I E\pk;in the (hilowing services of COR BA. K
,.i j |.[0,v will you integrate a COM component in a Web application? 1
/Vpfr b- ExPlain lhe rclation bctween ThrcadApartmcntProcess ard 0bject in delaiL s
OR
I
"> i Wlm are the three simple axioms associated wi'h COM s reference counting 7_
l~ 1 1 1 . ______ i,. linn AHHT! (*f mrlhrid.
ytfa ruk';'1 Give the common si'iP'.ion'' Ui"1 require calling tSe AddRef method.
b. Write short notes on:
Write short notes on: q
lilMTAandSTA. V
'f.O~ i'ilCrcs apa:inient access. J
My cr.aso
|
ThIjIu 1 Random Digits VENKATTESH. B. IYER B. N. Bandodkar. College {07-09 Batch) | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
|
C0N/3814-PD-2022-05.
|
Attachment: |
| Earning: Approval pending. |
