Answer:
Number of packets ≈ 5339
Explanation:
let
X = no of packets that is not erased.
P ( each packet getting erased ) = 0.8
P ( each packet not getting erased ) = 0.2
P ( X ≥ 1000 ) = 0.99
E(x) = n * 0.2
var ( x ) = n * 0.2 * 0.8
∴ Z = X - ( n * 0.2 ) /
~ N ( 0.1 )
attached below is the remaining part of the solution
note : For the value of <em>n</em> take the positive number
Answer:
The answer is A
Explanation:
Basically, Shortest job first (SJF) is a scheduling policy that selects jobs on queue for execution within a short execution time.
From the definition of SJF above, it means that there are a lot of process on queue and the (SJF) job is to receive processes on queue to execute within a short execution time.
Therefore, if all the jobs or process arrives at the SJF at the same time, the SJF will forfeit one of its major purpose which is scheduling of jobs.
That will therefore not make Non-preemptive Shortest Job First (SJF) not function at its optimal point.