Question: Assume there are 6 processes with id, arrival time and burst time as shown below (see Table 2). Table 2 a) Based on the above


Assume there are 6 processes with id, arrival time and burst time as shown below (see Table 2). Table 2 a) Based on the above information, Draw a Gantt chart for the following algorithms: i. Round-Robin (Time Quantum: 3 milliseconds) ii. Shortest Remaining Time (SRT) (8 Marks) (7 Marks) iii. First-come-First Serve (FCFS) (6 Marks) iv. Shortest Job First (SJF) (6 Marks) b) Compute the following using Shortest Remaining Time: i. Response time ii. Throughput (3 Marks) iii. Average waiting time (1 Marks) iv. Average turn-around time (2 Marks) (2 Marks)
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
