Question: Using shortest-job-first scheduling algorithm OR round-robin scheduling... I do not understand how to solve shortest-job-first scheduling or round-robin scheduling. Can anyone show me how to
Table Ishows that there are four jobs in the queue. Job I arrived first, and 4 last. Their priority is given in shown in the middle column (1 is the lowest and 4 is highest), and CPU time is shown in right column. For the following questions, please fill the blanks (time unit: msec). 1) Using first-come first-serve scheduling algorithm, 1. Table1 Job # 1 Priority CPU time -250 turnaround time for Job 1 is: _ turnaround time for Job 2 is: turnaround time for Job 3 is: turnaround time for Job 4 is: average turnaround time is: 450 150 2 | 350 4 2) Using shortest-job-first scheduling algorithm, turnaround time for Job l is turnaround time for Job 2 is: turnaround time for Job 3 is: turnaround time for Job 4 is: average turnaround time is: Using priority scheduling algorithm, - 3) turnaround time for Job I is turnaround time for Job 2 is: turnaround time for Job 3 is: turnaround time for Job 4 is: average turnaround time is: Using round-robin scheduling algorithm. 4) turnaround time for Job 1 is turnaround time for Job 2 is: turnaround time for Job 3 is: turnaround time for Job 4 is: average turnaround time is
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
