HNGA3Z San A-LVV-O-UVD STATISTICS—IV | Time Allowed : Three Eours Maximum Marks : 200 INSTRUCTIONS Please read each of the following instructions carefully before attempting questions. There are EIGHT questions divided under TWO Sections. Candidate has to attempt FIVE questions in ALL. Question Nos. 1 and 5 are compulsory and out of the remaining, THREE are to be attempted choosing at least ONE from each Section. ‘The number of marks carried by a question, part is indicated against it. Candidates should attempt questions/parts as per the instructions given in the Section. All parts and sub-parts of a question are tc be attempted together in the answer-book. Attempts of questions shall be counted in chronological order. Unless struck off, attempt of a question shall be counted even if attempted partly. Any page or portion of the page left blank in the answer-book must be clearly struck off. Unless otherwise mentioned, symbols and notations have their usual standard meanings. | Assume suitable data, if necessary and ind: the same clearly. Answers must be written in ENGLISH only. sate | 156 [ P.T.C.1. (a) (b) () {a (e) Section—I Illustrate the following :e:ms with an example : (i) Irreducible Markov chain (i) Renewal process (iii) Wide-ser-se stationary process (iv) Martingale If N(t) is a Poisson process, then show that, as t 3 oo af NO. Mention the situation(s) where ‘periodic review policy’ and ‘continuous review policy’ in inventory theory are used, and elaborate the ideas of the above policies. >a 0 Prove that the number of basic variables in a balanced transportation problem is at most m+n-1, where m is the number of origins and n is the rumber of destinations. Give all basic solutions to the following : 12x, + 8x2 +x3 =80 Xy +4x9 +x4 =48 Are these solutions feasible solutions for an LPP setup? A-LVV—3-UVD/56 2- (a) Define a Galton-Watson brancking process. If {7} :s the o%fspring distribution, then frove the fcllowing identities : 10 ) Pr =F, fP(9)] (a) Py(s)= PIP, (3)) (b) () Discuss a one-dimensional random walk. fi) What is Gambler’s -uin proslen? Obtain the probebilty of ruin, if Gambler plays wich a capital of a rupees. 10 (c) What is a Wiener process? Cbtain tae forward diffusion equa:ior. of a W:ener process. Also discuss any twc applications of this process. 10 (a) Show that for M/W/l/x queue model Pra where A, and pt, are the means o° Poisson and exponential cistributions respectively when there are n people in the system. 10 A-LVV-O-UVD/56 3 [ P.T.o. | ne3. (a) (b) Solve the fcllowing prcblera by Simplex method : Maximize Z = 8x, +6x, subject to Xy+Xq S10 2x) +3x_ $25 4 +5xX_ $35 X,X_ 20 A solicitors’ jirm employs typists on hourly price-rate basis for their daily work. There are five typists and their charges and speeds are different. According to an earlier -inderstanding, only one job is given to one typist and the typist is paid for a full hour even if he works for a fraction of an heur. Find the least cost allocation fcr the following data : 10 10 Typist Rate per | No. of pages hour (®) | typed/hour Job No. of pages boa dD D> 5 12 199 14 175 8 145 10 298 hk wo sh Rov lL 178 A-LVV-O-UVD/56 44. () (d) fa) (b) Derive a formula to simulate a random observation from a Pcissor: random variable. 10 What is the basis of classification of inventory in ABC analys:s? Illustrate iz with a simple example. 10 Define a Poisson process. Stating the regularity conditicrs, show that P, (t) = P{ M(t) = n} is given by the Poissor. law “Ag pn Py-2 ON" | n=0,1,2,.. 10 ni If X, is a branching process with E(X)=m= Yk. k=0 and o? = var(X;), then show that f) E{X,} =m" n-1 ( (i) var{X,} = A-LVV-O-UVD/56 5 [ P.T.o.() (a) Trim Sheet Company requires rectangular sheets of width 5, 7 and 9 inches to be cut from a rel. of width 20 inches. One-dimensional cut-ing is considered. The requirements are 300, 400 and 600 sheets of the three widths respectively. Write a linear program- ming problem to minimize waste assuming that the excess sheets cut are treated as waste. Given the following basic fecsitle solution to a transportation problem, cbtain four iterations of the op-imal solution using stepping stone methad : Demands 4 6 8 8 49 20 | 20 1 g fel 8 6 7 5 50 10 8 a 5] [7, |e 8 50 10. 40 20 30 50 50 A-LVV-O-UVD/56 6 1c 10(a) (b} Section—II 5. Attempt all of the followirg : 8x5=40 Explain stationa-y and s-able population. State the situatior. when the age distributior of two stable populations would te identical. 8 Compute the crude end standerd.zed death rates of the posulations A and B, regarding A as standard populat-on, from the following deta : 8 Age group 4 B {years} | population | Deaths | Population | Deaths Under 10 | 20000 | 600 12000 | 372 10-20 12000 | 240 , 3900¢ 6€0 20-40 s0000 | 1250 | 62000 | 16.2 40-60 30000 | 1050 | 15000 | 525 Above 69 | 10000 | 500 3000 180 (c) Explain briefly the uses of life table. 8 (a) Explain stack and qveie structures A-LVV-O-UVD/56 7 [ P.T.o. with suitable examples. Write the algorithm to ‘add’ and ‘delete’ into « stack and queue covering al! possible cases. 8(e) Write an algorithm/flowcnart or @ computing product of two matrices A and B of orders mxn and nxp respectively. 8 6. (aj Discuss the main sovrces of demographic data in the Indian syste. Give your suggestion for the measures to improve the quality of data. 10 (b) Compute GFR, SFR, TFR and GRR from the data given below : Age group of child- bearing females: 15-19 20-24 25-29 30-34 Number of women (000) : 160 164 158 152 Age group of child- bearing females: 35-39 40-44 45-49 Number of women (000) 2 148 150 14-5 Assume that the proportion of female births is 46-2 percent. 10 (o) Describe King’s method for constrvctiag an abridged life table. 10 (a) Explain the Matrix method of population projection. 10 A-LVV-O-UVD/56 8e.. fa) A list of n cistinct inegers is given. Write an algorithm/flowchart, using minimum number 0° comparison operations, to find out the second maximum number (i.c., the number less than the max.mum number but greater than the others). 1G (b) Describe various types 0° keys, with appropriate examples, in regard to a database management sys:em. 1G (c) Write down the algorittm to evaluate Lrevax using Weddle’s rule. How do you implement it in finding P(X > 2), where X~ NO, 1)? 1G (d) Write an algcrithm/flow2hart to check whether an input non-zerc integer n -s . prime. Prove that the main loop of tke algorithm/flowchart for this purpose _s to be executed up to[/n | times, where [Vn 1 stands for the least irteger greater than or equal to Vn. md A-LVV-O-UVD/56 9 [ PTO.8. (a) (b) () (a) Explain the meaning of the following rates in vital statistics and discuss their importance : () Crude ceath rate (i) Standard birthrate (ii) General fertility rate Briefly indicate how these rates can be used in population projection. Describe the procedure and steps ‘or the construction of life table Describe various types of operatiag systems. Consider the following four numbers : (1) @=567 in octal representation (2) b=ABC in hexadecimal represen- tation (3) c=220 in a hypothetical number system with base 3 (4) d=786 in another hypothetical number system with base 9 Answer the following questions f) Convert a directly into the corres- ponding number in hexadecimal representation A-LVV-O-UVD/56 10 10@ (ii) Conver+ ¢ directly into the corres- ponding number in the Eypothetical number system -vith tase 9. (ii) Add a and b to produce the resul: im hexadecimal number system. (iv) Add c and d to generate the result in the hypothetical number system with base 9. 1c kkk A-LVV-O-UVD/56 11 SBS—8000