Question: Consider the FIVE (5) process with their CPU burst time and arrival time. Process PO P1 P2 P3 P4 II. Arrival Time 0 2
Consider the FIVE (5) process with their CPU burst time and arrival time. Process PO P1 P2 P3 P4 II. Arrival Time 0 2 1 1 3 CPU burst time 1 3 4 3 2 Based on the above data, answer the following a) Draw a timeline for the following algorithm: Shortest Job First (SJF) I. Shortest Remaining Time (SRT) b) Calculate the turn-around time for SRT algorithm. c) Calculate average turn-around time for SRT algorithm. d) Calculate the response time for SJF. e) Calculate the waiting time for SJF. f) Which algorithm is the best among SJF and SRT? Justify your answer. (5 Marks) (5 Marks) (5 Marks) (1 Marks) (2.5 Marks) (2.5 Marks) (5 Marks) (Total: 26 Marks)
Step by Step Solution
3.43 Rating (162 Votes )
There are 3 Steps involved in it
a Timeline for SJF and SRT SJF Timeline P0 01 P1 23 P3 47 P4 79 P2 912 SRT Timeline P0 01 P1 23 P0 3... View full answer
Get step-by-step solutions from verified subject matter experts
