Consider the following snapshot of a system: Process Maximum A B C D Allocation R1 R2 R3 R1 R2 R3 6 4 3 01 0 3 2 2 7 0 2 2 2 2 200 3 0 2 2 1 1 Which of the following is not a safe sequence? Available resources R1 3 R2 2 R3 4

Process PI P2 P3 P4 P5 Buast time 2 1 8 4 5 Priority (2*xx) %5 (2xxx) 5 (2*XX) 0/0 5 (2*XX) do 5 (2*xx) do 5 ✓ 11 Value of XX is 5 All processes Arrives at time + = 0 ms. Draw the Gantt chart for priority scheduling (A larger priority number implies higher priority)

In the following resource allocation graph, are the processes deadlocked? If “yes” explain why and state which processes are involved in deadlock. If “not” explain why.

Eight batch jobs arrive almost at the same time in the following order: I₁, 2, ..., II8. The table below contains their running times and priorities: Job П1 П2 П3 П4 П П П П Running time (in min) 4 5 5 10 8 10 7 Priority 1 7 5 2 8 6 4 3 The highest priority is 1. For each of the following scheduling algorithms, determine the order of execution of processes and the mean process turnaround time: (a) priority scheduling; (b) first-come, first-served; (c) shortest job first. Scheduling is non-preemptive.