Documenti di Didattica
Documenti di Professioni
Documenti di Cultura
R*g. No. :
Marks)
1. Give the set ortruth vatues oran
'-iffi"*l*ured in tu" iotnrl.ff,]:
2. Defi ne confitional and qualifi sd propositions.
3. State Cholesky'salgorithm. papertsol m
4. Define Generalized eigenvector. wllw'recentquestion
(o 1 1\
L2. a) Obtain the QR decomposition,of the matrix A = (13)
Ll:tl
(oR)
(oR)
L4. a) IJse dynamic programming to show tbatz= P, log P, * P, logPz + ... + P,logpo
subject to the constraints p, + Pr* ... + Po = L and P: 2 0 is minimum if
pr + pz + ... + pn= /n (13)
-a
(oR)
lllilll ililr ffiil ililrillil ilililil -3- 47225
b) The owner of a chain of four grocery stores has purchased six crates of fresh
strawberries. The following table gives the estimated total expected profit at
each store, when it is allocated various number of crates.
I II III IV
0 0 0 0 0
1 4 2 6 2
paper rco[Il
2 6 4 8 3 $l!.Jw . recentquertron
3 7 6 8 4
4 7 8 B 4
5 7 9 8 4
6 7 10 8 4
Pind the allocation of six crates to four stores so as to maximize the
expected profit. (13)
15. a) Arrival rate of telephone calls at a telephone booth are considered to be Poisson
with an average time of minutes between one arrival and the next. The length
12
of a phone call is assumed to be distributed exporientially with mean 4 minutes.
2) Ita customer has to wait in the queue, what is the expected length of the
waitingtime ?
3) What is the average number of customers who has to actually wait ? (1S)
47225 -+ Iffitil ililtflil ililtililtilflillt
^#-dFos'
,on$r
1QP
-tqtn$'