Answer:
The explanation is for 10 inputs though. You'd have to follow these steps to find input 50 numbers.
Explanation:
This is how I wrote it in the Plain English programming language which looks like pseudo-code but compiles and runs (to save you all the rest of the steps):
To run:
Start up.
Write "Enter 10 numbers separated by spaces: " on the console.
Read a reply from the console.
Loop.
If the reply is blank, break.
Get a number from the reply.
Add 1 to a count.
Add the number to a total.
Repeat.
Write "The total is: " then the total on the console.
Put the total divided by the count into an average.
Write "The average is: " then the average on the console.
Refresh the screen.
Wait for the escape key.
Shut down.
Answer:
Means no matter how many processors you use, speed up never increase from 10 times.
Explanation:
If a problem of size W has a serial component Ws,then performance using parallelism:
Using Amdahl's Law:
Tp = (W - Ws )/ N + Ws
Here, Ws = .1,
W - Ws = .9
Performance Tp = (.9 / N) + .1
---------------------------------------------------------
Speed Up = 1 / ( (.9 / N) + .1)
If N -> infinity, Speed Up <= 10
Means no matter how many processors you use, speed up never increase from 10 times.
To protect my computer form hacking and save my files