Calls to a customer service center last on average 2.8 minutes with a standard deviation of 1.4 minutes. An operator in the call
1 answer:
Answer:
The expected total amount of time the operator will spend on the calls each day is of 210 minutes.
Step-by-step explanation:
Normal Probability Distribution:
Problems of normal distributions can be solved using the z-score formula.
In a set with mean and standard deviation
, the z-score of a measure X is given by:
The Z-score measures how many standard deviations the measure is from the mean. After finding the Z-score, we look at the z-score table and find the p-value associated with this z-score. This p-value is the probability that the value of the measure is smaller than X, that is, the percentile of X. Subtracting 1 by the p-value, we get the probability that the value of the measure is greater than X.
n-values of normal variable:
Suppose we have n values from a normally distributed variable. The mean of the sum of all the instances is and the standard deviation is
Calls to a customer service center last on average 2.8 minutes.
This means that
75 calls each day.
This means that
What is the expected total amount of time in minutes the operator will spend on the calls each day
This is M, so:
The expected total amount of time the operator will spend on the calls each day is of 210 minutes.
You might be interested in
Answer with explanation:
→Number of Integers from 1 to 100
=100(50 Odd +50 Even)
→50 Even =2,4,6,8,10,12,14,16,...............................100
→50 Odd=1,3,,5,7,9,..................................99.
→Sum of Two even integers is even.
→Sum of two odd Integers is odd.
→Sum of an Odd and even Integer is Odd.
(a)
Number of ways of Selecting 2 integers from 50 Integers ,so that their sum is even,
=Selecting 2 Even integers from 50 Even Integers , and Selecting 2 Odd integers from 50 Odd integers ,as Order of arrangement is not Important, ,
=4900 ways
(b)
Number of ways of Selecting 2 integers from 100 Integers ,so that their sum is Odd,
=Selecting 1 even integer from 50 Integers, and 1 Odd integer from 50 Odd integers, as Order of arrangement is not Important,
=2500 ways