Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
SING TEST
The sign test is the simplest of the parametric tests. Its name comes from the fact that it is based on the direction ( or sings for pluses or minuses ) of a part of observation and not on their numerical magnitude.
In any problem in which sign test is used we count:
Number of + sings
Number of - sings
Number of 0 s ( i, e, which cannot be included either as positive or negative)
We take H0 p= 0.5( Null hypothesis)
If the difference is due to chance effects the probability of a +sing for any particular pair is 1/2as is the probability of a -sing. If s is the number of times the less frequent sign occurs then S has the binomial distribution with p= ½.
The critical value for a two sided alternative at α= 0.05 can be conveniently found by the expression.
K = (n -1)/ 2 -( 0.98)√n
Ho is rejected if S ≤ K for the sign tests.
The sign test can be of two types:
a.The one sample sign test
b. The paired sample sign test
Normal 0 false false false EN-IN X-NONE X-NONE MicrosoftInternetExplorer4
In this method variables beings studied are controlled by the investigator. In other the effect of one variable is observed while other relevant variables are held constant
Question: Machine A costs Rs. 9000. Annual operating costs are Rs. 200 for the first year, and then increase by Rs. 2000 every year. Suppose that the machine has no resale valu
#what is the similarity and differences between transportation and linear programing models?
AI TECHNOLOGY''S CURRENT AND POTENTIAL FUTURE APPLICATIONS
definatins and example
Solve the following Linear Programming Problem using Simple method. Maximize Z= 3x1 + 2X2 Subject to the constraints: X1+ X2 = 4 X1 - X2 = 2 X1, X2 = 0
b. A paper mill produces two grades of paper viz., X and Y. Because of raw material restrictions, it cannot produce more than 400 tons of grade X paper and 300 tons of grade Y pape
Solve the following Linear Programming Problem using Simplex method. Maximize Z= 3x1 + 2X2 Subject to the constraints: X1+ X2 = 4 X1 - X2 = 2 X1, X2 = 0
Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd