Consider multilevel queue scheduling where four queues are present. Queue 1 takes processes with priority values...

 

Transcribed Image Text:

Consider multilevel queue scheduling where four queues are present. Queue 1 takes processes with priority values 1-5, Queue 2 takes processes with priority values 6-12, Queue 3 takes processes with priority values 13-20 and Queue 4 takes rest of the processes. Queue 1 uses round robin scheduling wit time quantum 4 and Queue 2 uses round robin scheduling wit time quantum 5. Queue 3 and 4 use FCFS. Draw the Gantt chart and calculate average waiting time for the processes shown in the following table. Process P1 X P2 X P3 XP4 * P5 XP6 X P7 XP8 X P9 Priority 25 6 Process P1 P2 P3 P4 P5 4 14 3 (17 (20 15 1. Burst time 7 4 12 Arrival Time 0 5 10 16 25 2 9 8 THIS SITE you.. Draw the Gantt chart and calculate average waiting time using shortest remaining time first scheduling. Use the same table. Use this table for both Q4 and Q5. 5 11 2 Burst time 7 10 12 2 9 Consider multilevel queue scheduling where four queues are present. Queue 1 takes processes with priority values 1-5, Queue 2 takes processes with priority values 6-12, Queue 3 takes processes with priority values 13-20 and Queue 4 takes rest of the processes. Queue 1 uses round robin scheduling wit time quantum 4 and Queue 2 uses round robin scheduling wit time quantum 5. Queue 3 and 4 use FCFS. Draw the Gantt chart and calculate average waiting time for the processes shown in the following table. Process P1 X P2 X P3 XP4 * P5 XP6 X P7 XP8 X P9 Priority 25 6 Process P1 P2 P3 P4 P5 4 14 3 (17 (20 15 1. Burst time 7 4 12 Arrival Time 0 5 10 16 25 2 9 8 THIS SITE you.. Draw the Gantt chart and calculate average waiting time using shortest remaining time first scheduling. Use the same table. Use this table for both Q4 and Q5. 5 11 2 Burst time 7 10 12 2 9

Answer rating: 100% (QA)

To solve the scheduling problem described in the question well first understand the multilevel queue ... View the full answer