Divide & Conqure Dynamic Programming Partition a problem into independent smaller sub problems Partition a problem into overlapping smaller sub problems Doesnt store solution of sub-problems.(identical sub-problems may arisse-results in the same computations are performed repeatedly.) stores solution of sub-problems : thus avoids calculations of same quantity twice Top down alogithms : which logically progresses from the initial instance down to the smallest sub- instances. Bottom up algorithms : in which the smallest sub-problems are explicity solved first and the results of the used to construct solutions to progressively larger sub-instances.
Let MSA defines mean sum of squares due to factor A and MSE defines mean sum of squares due to error. If the null hypothesis of ANOVA for one way class...
Which one is not basis of classification of data.
If the population kurtosis of the observations 16,12,6,2,4,10 is 1.7414, then population kurtosis of the 8,6,3,1,2,5 is
Which of the following methods is NOT used in computation of a seasonal index for time series?
If Z1, Z2,…Zn are n independent standard normal variates, then Σni=1 Z2i will follow:
A dice was thrown 400 times and 'six' resulted 80 times. The data is used to justify the hypothesis of an unbiased dice at 95% confidence. With referen...
If a discrete random variable X follows uniform distribution and assumes only the values 8, 9, 11, 15, 18, 20, the value of P(|X-14| < 5) will be:
For ANOVA table
the F - statistics is:
