Answer:
3.59 minutes
Explanation:
We solve this question using z score formula
Using Excel
Z-SCORE= (DataPoint-AVERAGE(DataSet))/STDEV(DataSet)
IN EXCEL,
AVERAGE, an excel function that calculates the Average of data set
STDEV.S: calculates the standard deviation while treating the data as a ‘sample’ of a population.
STDEV.P: This function calculates the standard deviation while treating the data as the entire population.
Z score formula = x - μ/σ
x = ?? μ = 2.5 minutes σ = 0.5 minutes
We are asked : If 1.5% of the callers are put on hold for longer than x minutes, what is the value of x?
Hence, Longer than = Greater than =
100 - 1.5%
= 100 - 0.015
= 0.985 ( 98.5%)
Using Excel we calculate = z score for 98.5 percentile
= 2.1701
Z score = x - μ/σ
2.1701 = x - 2.5/0.5
2.1701 × 0.5 = x - 2.5
1.08505 = x - 2.5
x = 1.08505 + 2.5
x = 3.58505
Approximately to 2 decimal places = 3.59 minutes
Therefore, 1.5% of the callers are put on hold for longer than 3.59 minutes.
For one to be able to verify that the ip address sorting criteria that has not been configured to overlap between different groups you can use the check IP group - testing.
<h3>What does IP group do?</h3>
The term IP Group is known to be one that looks at or is one whose purpose is so that it can generate a lot of a positive social and also that of environmental impact with financial returns.
Note that this is one that offers shareholders a kind of an exposure to a a lot of portfolio of opportunities that is made up of a high-growth businesses in regards to the growth markets.
Hence, For one to be able to verify that the ip address sorting criteria that has not been configured to overlap between different groups you can use the check IP group - testing.
Learn more about IP address from
brainly.com/question/24930846
#SPJ1
<span>The INTERNET is a worldwide collection of networks that links millions of businesses, government agencies, educational institutions, and individuals.</span>
All console programs have a way to prompt for input.
For C#, the answer is Console.ReadLine().
For C, the answer is a.o. fgets()
For C++, the answer could be cin >>
... and so on...
Not sure what answer you need here.
Answer:
Pseudocode is as follows:
// below is a function that takes two parameters:1. An array of items 2. An integer for weight W
// it returns an array of selected items which satisfy the given condition of sum <= max sum.
function findSubset( array items[], integer W)
{
initialize:
maxSum = 0;
ansArray = [];
// take each "item" from array to create all possible combinations of arrays by comparing with "W" and // "maxSum"
start the loop:
// include item in the ansArray[]
ansArray.push(item);
// remove the item from the items[]
items.pop(item);
ansArray.push(item1);
start the while loop(sum(ansArray[]) <= W):
// exclude the element already included and start including till
if (sum(ansArray[]) > maxSum)
// if true then include item in ansArray[]
ansArray.push(item);
// update the maxSum
maxSum = sum(ansArray[items]);
else
// move to next element
continue;
end the loop;
// again make the item[] same by pushing the popped element
items.push(item);
end the loop;
return the ansArray[]
}
Explanation:
You can find example to implement the algorithm.
