Question: Question 6: Process B D E CPU burst time 100 10 300 60 150 Priority 3 1 3 5 4 1. FIRST COME FIRST SERVED


Question 6: Process B D E CPU burst time 100 10 300 60 150 Priority 3 1 3 5 4 1. FIRST COME FIRST SERVED : FCFS, IN ORDER ABCDE Draw the corresponding GANTT chart 2. SHORT JOB FIRST : SJF Draw the corresponding GANTT chart 0 3. PRIORITY Draw the corresponding GANTT chart 0 Question 7: Consider the First-Come, First-Served (FCFS) Scheduling Algorithm with the following data Process Execution time Arrival time P 5 1 P2 3 P, 6 0 . 2 Ps 4 1. Is this Algorithm preemptive or non-preemptive? 4 3 7 2. Illustrate the Gantt chart P3 O 3. Calculate the waiting time of each process 4. Calculate the average waiting time . Question 13: Consider the Round Robin Scheduling Algorithm and Quantum Q=1 with the following data Process Execution time Arrival time P 5 1 P2 4 3 P 6 0 PA 3 2 Ps 7 4 1. Is this Algorithm preemptive or non-preemptive? 2. illustrate the Gantt chart 0 3. Calculate the waiting time of each process 4. Calculate the average waiting time *****
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
