Q6.

Consider the following set of processes:

Process

PI

P2

P3

P4

PS

P6

Burst-Time

15

3

Priority

8

5

2

5

Processes are assumed to arrive in the order P1, P2, P3, P4, P5, and P6 all at time 0. Use FCFS, SJF, Round Robin (quantum2), and Priority (low numbers have high pianty). For

Q6. Consider the following set of processes: Process Burst-Time Priority PI 15 P2 P3 P4 PS P6 Processes are assumed to arrive in the order P1, P2, P3. P4, P5, and Po all at time 0. Use FCFS, SJF, Round Robin (quantum2), and Priority (low numbers have high priority). For each of the algorithms i. Draw a Gantt chart it. Obtain the average waiting time ill. Obtain the average turnaround time