ALL > Computer and Education > courses > university courses > undergraduate courses > Operating System > ZSTU-(2020-2021)-1 > homework notification >
homework-3 Version 0
👤 Author: by writer 2020-09-29 02:15:03
Set  your own example  for the set of processes, with the length of the CPU burst given in milliseconds,  arriving time and order.  For First-come,first-served(FCFS) scheduling algorithm  ,

  1.  calculate turnaround  time for every process


2.  maximum turnaround time

3.  minimum turnaround time

4.  average turnaround time

5.  calculate waiting time  for every process

6.  maximum  waiting  time

7.  minimum  waiting time

8.  average waiting  time

 

 

Please login to reply. Login

yeqirunoutlookcom • 2020-10-13 15:11:38
<a href="http://www.yvsou.com/wp-content/uploads/sites/30/2020/10/236AC975-1A17-4950-A927-3ED3FC1D6C87.png"><img class="alignnone size-medium wp-image-8635" src="http://www.yvsou.com/wp-content/uploads/sites/30/2020/10/236AC975-1A17-4950-A927-3ED3FC1D6C87-300x225.png" alt="" width="300" height="225" /></a> PostVer 0

Please login to reply. Login

Reversion History

Loading...
No reversions found.