Module 2 QB PDF
Module 2 QB PDF
in milliseconds. The processes are assumed to have arrived in the order P1, P2,P3. Draw
a Gantt Chart and calculate the average waiting time and average turnaround time for all
processes using Round Robin (quantum = 2 ms) and SJF.
Process Arrival Burst
P1 0 5
P2 1 10
P3 2 2
P4 3 1
Consider the following set of processes, with the length of the CPU burst is given below in
milliseconds. The processes are assumed to have arrived in the order P1,P2,P3. Draw a Gantt
Chart and calculate the average waiting time and average turnaround time for all processes
using Round Robin (quantum = 2 ms) and Priority scheduling algorithms
Process Arrival Burst Priority
P1 0 10 3
P2 1 1 1
P3 2 2 3
P4 3 1 4
P5 4 5 2
Consider the following set of processes, with the length of the CPU burst is given below in
milliseconds. Draw a Gantt Chart and calculate the average waiting time and average
turnaround time for all processes using Round Robin (quantum = 2 ms) and FCFS CPU
scheduling algorithms.
Process Arrival Burst
P1 0 24
P2 1 3
P3 2 3