Back to the 2019 paper
Similar questions
OPERATING SYSTEMConsider the following process: | Process | Arrival Time | Burst Time | | :--- | :--- | :--- | | P1 | 0.0 | 7 | | P2 | 2.0 | 4 | | P3 | 4.0 | 1 | | P4 | 5.0 | 4 | Considering non-preemptive and preemptive SJF algorithm, find out average waiting time and average turnaround time in both cases.201914mOperating SystemConsider the following set of processes with the length of the CPU burst given in milliseconds: | Process | Burst Time | Priority | | :---: | :---: | :---: | | A | 10 | 3 | | B | 1 | 1 | | C | 2 | 3 | | D | 1 | 4 | | E | 5 | 2 | The processes are assumed to have arrived in order A, B, C, D, E all at time 0. Draw the Gantt charts that illustrate the execution of SJF scheduling algorithm. Show which algorithm results in the minimum average waiting time.20257mOperating SystemConsider the following set of processes with the length of the CPU Burst given in milliseconds: | Process | Burst Time | Priority | | :--- | :--- | :--- | | A | 10 | 3 | | B | 1 | 1 | | C | 2 | 3 | | D | 1 | 4 | | E | 5 | 2 | The processes are assumed to have arrived in order A, B, C, D, E all at time 0. Draw the Gantt charts that illustrate the execution of FCFS and SJF scheduling algorithm. Show which algorithm results in the minimum average waiting time.20247mOPERATING SYSTEMAssume the following workload in a system: | Process | Arrival Time | Burst Time | | :--- | :--- | :--- | | P0 | 1 | 3 | | P1 | 0 | 6 | | P2 | 3 | 2 | | P3 | 4 | 7 | | P4 | 2 | 8 | | P5 | 6 | 5 | Illustrating the execution of these job using Round Robin Scheduling algorithm calculate when given Time Quantum=3 : (i) Average Turn Around Time (ii) Average Waiting Time20247m