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.
True, but the only way to get these constant place holders is of you program them in, in other words you have to tell the computer that you want them.
You have to destroy the hard drive as it is like a memory for the computer so it can never be deleted
A computer helps us learn connect to people and play games the person who made it was Charles Babbage he made computers in London and it was made by 1791 to 1871 they made it so we can learn see people from far and play
