Question

Answer the following questions about computer operating systems:

1. Consider the following set of processes, with the length of the CPU-burst time given in milliseconds:

Process	Burst Time	Priority
P1	10	3
P2	1	1
P3	2	3
P4	1	4
P5	5	2

The processes are assumed to have arrived in the order P1, P2, P3, P4, P5, all at time 0

1. Draw four Gantt charts illustrating the execution of these processes using FCFS, SJF, nonpreemptive priority (lower number implies a higher priority), and RR (quantum=1) scheduling. (If you do this on paper, take a photo with your phone and insert it into your document, and upload the photo as a separate jpeg file as well.)
2. What is the turnaround time of each process for each of the scheduling algorithms in part a?
3. What is the waiting time of each process for each of the scheduling algorithms in part a?
4. Which of the schedules in prat a results in the minimal average waiting time (over all processes)?

1. Consider the following resource allocation table.

Allocated

Process	R1	R2	R3
P1	2	3	0
P2	1	1	1
P3	4	1	2
P4	0	0	1
P5	0	0	0

Need

Process	R1	R2	R3
P1	5	0	4
P2	2	0	1
P3	0	1	0
P4	5	2	1
P5	6	4	0

Available = (0 1 1)

Which, if any, of the processes above are deadlocked? If they are not deadlocked, in which order can the processes above execute?

Answer 1

According to the policy, in case of multiple Questions, only dirst one is mandatory. So, solving question 1, as per the time permits.