Consider the set process. There arrival time start from 0, Consider your seat number as burst time also consider all time value in seconds. Find average time of following Scheduling Algorithm. Note (quantum=2)
(a) Longest Remaining time first (LRTF) (Preemptive)
(b) Round Robin Scheduling (LRTF) (Non- Preemptive)
Answers
Answered by
1
Answer:
Scheduling of processes/work is done to finish the work on time.
Below are different time with respect to a process.
Arrival Time: Time at which the process arrives in the ready queue.
Completion Time: Time at which process completes its execution.
Burst Time: Time required by a process for CPU execution.
Turn Around Time: Time Difference between completion time and arrival time.
Turn Around Time = Completion Time – Arrival Time
Waiting Time(W.T): Time Difference between turn around time and burst time.
Waiting Time = Turn Around Time – Burst Time
Explanation:
Can You Make Me Brainlist
Similar questions