Sheet 7

1- Suppose that the following processes arrive for execution at the times indicated. Each
process will run the listed amount of time. In answering the questions, use non-
preemptive scheduling and base all decisions on the information you have at the time
the decision must be made
Process Arrival Time Burst Time
P1 0 8
P2 2 4
P3 4 1

a) What is the average turnaround time and waiting time for these processes with the
FCF Scheduling algorithm?
b) What is the average turnaround time and average time for these processes with the
SJF scheduling algorithm?
c) What is the average turnaround time and average time for these processes with the
SRTF scheduling algorithm?

2- Consider below table of four processes under multilevel queue scheduling. Queue
number denotes the queue of the process. Assume that Quantum=4 ms for Queue 1
and Quantum =3 ms for Queue 2. Assume that Queue 1 has higher priority when
compared to Queue 2.

Process Arrival Time CPU Burst Time Queue Number (priority)

A 0 10 2

B 3 7 1
C 4 6 2
D 12 5 1

E 18 8 1