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:
This is the second question like this I've seen. They aren't the greatest.
Explanation:
The question is not good. The answer would be option a, Transport even though it doesn't make a whole lot of sense when you really go into detail.
It could also be option d, Application but I think they're going for the first.
I think it is but it isn't as well, it could bring friends together but it could also split friendships.