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.
Answer:
Mark me a brainless plss i need that i am blink plss
Answer:
Let me see the picture clearly
Explanation:
Answer:
Explanation:
So i have issues typing it here, because it keeps saying trouble uploading your answer as a result of inappropriate words/links, so i will just make a screenshot of it.......
Just save the the above code in python file and execute it, you should arrive at your answer.
Attached below is the code and sample screenshot of what you should expect
cheers !!!!
