Given three processes (process id P0, P1, P2 respectively) with compute time bursts 6, 2, and 8 units. All processes are available at t=0. Consider the shortest-job-first scheduling algorithm and find the sequence in which the processes will be scheduled.
Already registered? Login
Not Account? Sign up
Enter your email address to reset your password
Back to Login? Click here