Study the performance of the Least Completed Next (LCN), First come First Serve (FCFS), Shortest Job Next (SJN

Question

and Round Robin (RR) scheduling algorithms on the processes mentioned in the following table:
ProcessCPU Time
P1 2
P2 1
P3 3
P4 7
P5 5
Also, comment on the correctness of the following statements:

(a)“The weighted turn arounds in FCFS scheduling are arbitrarily distributed while those in Shortest Job Next (SJN) scheduling increase monotonically.”

(b)“Least Completed Next (LCN) scheduling provides better throughput than SJN scheduling.”

Answer 1

This should be under the Homework Help category.