Question

Reserve Problems Chapter 5 Section 7 Problem 4 The computational time of a statistical analysis applied to a data set can sometimes increase with the square of N, the number of rows of data. Suppose that for a particular algorithm, the computation time is approximately T=0.004N seconds. Although the number of rows is a discrete measurement, assume that the distribution of N is over a number of data sets can be approximated with an exponential distribution with a mean of 10000 rows. Determine the probability density function and the mean of T. Osr(t) = 1 where bl-In- VODE - zvani ° 54() = 100 =VEM where |- - 0.003 - 2 VO.Dodi 5() - 10000 - VELI where(1-3-ávodos Vo.

Answer 1

anCven thal T 0.004.N2 N Neap looo0)uith mcan 2 1ouvo N) exp Then Pd T 0.D04N2 = 0.o04 N Then Pdf bf T N2 0o04 flt)= (N).JI jacobfan NI- 2 0.004t OND4 And () .e LooD loooo OR 2o004 Auy So optfon. 4) f^ correct.