A systems analyst tests a new algorithm designed to work faster than the currently-used algorithm. Each algorithm is applied to a group of 46 sample problems. The new algorithm completes the sample problems with a mean time of 18.78 hours. The current algorithm completes the sample problems with a mean time of 19.06 hours. The standard deviation is found to be 5.614 hours for the new algorithm, and 5.012 hours for the current algorithm. Conduct a hypothesis test at the 0.1 level of significance of the claim that the new algorithm has a lower mean completion time than the current algorithm. Let μ1 be the true mean completion time for the new algorithm and μ2 be the true mean completion time for the current algorithm. Step 1 of 4 : State the null and alternative hypotheses for the test. A. Reject null hypothesis

B. Fail to reject null hypothesis

B. Fail to reject null hypothesis .

Step-by-step explanation:

We are given that a systems analyst tests a new algorithm designed to work faster than the currently-used algorithm.

Also, = true mean completion time for the new algorithm

        = true mean completion time for the current algorithm

Null Hypothesis, :  {Both new and current algorithm has same

                                                            completion time}

Alternate Hypothesis, : {New algorithm has lower mean

                                                           completion time than current algorithm}

The test statistics we use here will be :

              follows

where, = 18.78 hours   and       = 19.06 hours

              = 5.614 hours         and       = 5.012 hours

              = 46                        and       = 46

              = 5.321

Here, we use t test statistics because we know nothing about population standard deviations.

     Test statistics = follows

                             = -0.2524

At 0.1 or 10% level of significance t table gives a critical value between -1.296 and -1.289 at 90 degree of freedom. Since our test statistics is more than the critical table value of t as -0.2524 > -1.296 to -1.289 so we have insufficient evidence to reject null hypothesis.

Therefore, we conclude that new algorithm has same mean completion time with that of current algorithm.

solution:

→c= a b , that is product of a and b is possible only when when a is m × n matrix and b is n × p matrix.

that is, number of columns of a= number of rows of b.

so, size of matrix , c= a b is , if a = (m × n)matrix

b= (n × p)matrix

then a b = [ (m × n)matrix] ×[   (n × p)matrix ]

→→c= a b= [m × p ] matrix

→→size of product a b will be equal to = number of rows of a × number of columns of b

answer: 1475

step-by-step explanation:

becuase you have to know what they are asking you