Answer:
Below is code written in a free CAS (WxMaxima):
The above code creates the probability of 19 or more brown in the sample of 48 for population sizes from 5*19 to 10000 in steps of 5.
Here’s a plot of that data:
The horizontal blue line is the probability for an infinite population size (or, choosing each of the 48 M&Ms with replacement, which I infer is not what you meant). It is calculated using the binomial cdf:
The red curve approaches the blue line asymptotically as the population gets larger.
At population 10000, the red curve is
.
Use filler words like ummmm, like, so, kinda, or such. Faltering on her words, forgetting things, or not saying things with confidence wouldn't help either. Also, do not loose eye contact with the people even if you only occasionally look up, it makes you look nervous and like you don't know what you're talking about.
Answer:
General purpose computers are designed to be able to perform variety of tasks when loaded with appropriate programs, while special purpose computers are designed to accomplish a single task.
Answer:
See Explanation
Explanation:
Given
The attached function
What the recursion does is that; it adds up individual digits from N to 0
Solving (a): Each output when N = 6
For N = 6.
The function returns the following values:
f(6) = 6
Then: 6 + f(5)
Then: 6 + 5 + f(4)
Then: 6 + 5 + 4 + f(3)
Then: 6 + 5 + 4 + 3 + f(2)
Then: 6 + 5 + 4 + 3 + 2 + f(1)
Then: 6 + 5 + 4 + 3 + 2 + 1 + f(0)
Then: 6 + 5 + 4 + 3 + 2 + 1 + 0 = 21
Solving (b): The output when N = 7
Using the same process in (a) above.
The output is 28
Answer:
By Using the Greedy- Activity- Selection algorithm
Explanation:
The Greedy- Activity- Selection algorithm in this case involves
First finding a maximum size set S1, of compatible activities from S for the first lecture hall.
Then using it again to find a maximum size set S2 of compatible activities from S - S1 for the second hall.
This is repeated till all the activities are assigned.
It requires θ(n2) time in its worse .
