Suppose the ready list contains the processes as shown in the table. STEP 10- In float average turn around time equal to total divided be n value, and print the average waiting time and average turn around time.STEP 8- Print the value process burst time waiting time and turnaround time.STEP 9- tat equal to bt add the wt, tot add or equal to tat,and print the value p,bt,wt andtat.STEP 7- Waiting time for first process is zero, calculate waiting time, average waiting time.STEP 6- if pr less than pr, pos=i and create the temporary file and equal to the bt, bt equal to bt, btequal to temporary, temporary equal to p, so p equal to p and p equal their temporary file.STEP 5- Print the i+1, Burst time and Priority time in the P=i+1.STEP 4- Sorting burst time, priority and process number in ascending order using selection sort.STEP 3- Print the total number of process in the n.STEP 2- Declare the value of bt, p, wt, tat, pr, I, j, n, total=0, os, average waiting time and average turnaround time.
To Write a Program Using C to Implement the Priority Scheduling.
0 kommentar(er)
