Question: Process Arrival Burst Time Time p1 0 6 p2 1 4 p3 2 3 p4 4 1 p5 5 2 Based on the above information,

 Process Arrival Burst Time Time p1 0 6 p2 1 4

Process Arrival Burst Time Time p1 0 6 p2 1 4 p3 2 3 p4 4 1 p5 5 2 Based on the above information, answer the following a) Draw Gantt chart for the following algorithm i) FCFS(Non-preemptive algorithm) pi p2 p3 p4 p5 0 6 10 13 14 ii) SJF pl p4 p5 p3 p2 0 6 7 9 12 16 16 iii) p2 Round-Robin (3 millisecond) p1 p3 0 3 6 Shortest Remaining Time (SRT) p1 9 p4 12 p5 13 p2 15 16 iv) p1 0 p2 1 p4 5 p5 6 p3 8 p1 11 16 b) For the above algorithms, find the following: I. Turn-around time for each process II. Waiting time III. Average turn-around time IV. Average waiting time V. Completion time VI. Response time

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!