An operating system uses the banker’s algorithm for deadlock avoidance when managing the allocation of three resource types X, Y and Z to three processes P0, P1 and P2. The table given below presents the current system state. Here, the Allocation matrix shows the current number of resources of each type allocated to each process and the Max matrix shows the maximum number of resources of each type required by each process during its execution                     Allocation            Max   X Y Z X Y Z P0 0 0 1 8 4 3 P1 3 2 0 6 2 0 P2 2 1 1 3 3 3 There are 3 units of type X, 2 units of type Y and 2 units of type Z still available. The system is currently in safe state. Consider the following independent requests for additional resources in the current state- REQ1: P0 requests 0 units of X, 0 units of Y and 2 units of Z REQ2: P1 requests 2 units of X, 0 units of Y and 0 units of Z  Write a program to check whether: Only REQ1 can be permitted Only REQ2 can be permitted Both REQ1 and REQ2 can be permitted Neither REQ1 nor REQ2 can be permitted

Please send me answer of this question immediately and i will give you like sure sir

A service has five tasks, performed in sequence.  In the instance when there is more than one worker assigned to a task, each worker performs the entire task and they both can be working on different “items” at the same time. What is the throughput time (assuming no wait time)? Please provide details as to how this is calculated.    Task Task time per worker Number of workers 1 2 minutes 1 2 6 minutes 1 3 14 minutes 2 4 4 minutes 1 5 15   minutes 3

1. Two processes, A and B, each need three resources, 1, 2, and 3. Suppose 4 requests them in the order 1, 2, 3. If B also requests them in the same order, deadlock is not possible. However, if B requests them in the order 3, 2, 1, then deadlock is possible. With three resources, there are 3! or six possible orders in which B can request them. For each possible order in which B can request these resources, state whether or not a deadlock is possible for that order. (Assume that once a process acquires a resource, it does not release that resource until the end of that process.) a) 1, 2, 3 b) 1,3,2 c) 2, 1, 3 d) 2, 3, 1 e) 3, 1, 2 f) 3, 2, 1

An operating system uses a total of two units of the resource R for each of its three user processes. The operating system uses a total of 12 units of R. The absolute minimum number of R units that must be used to guarantee that there are no deadlocks is

Task 1: SJF Scheduling with preemption You can use the following input as sample: 22222 Proc P1 P5 Process P1 P2 P3 P4 Solution in a Gantt chart: P1 P2 P3 AT 3 4 P4 5 18 20 P5 Sample Output Structure: P2 3 P2 BT CT 8 22 5 18 6 20 3 27 3 28 Arrival Time 4 Grant Chart: Pl P5 P2 P1 P5 P2 0 WT 11 9 9 6 5 2 3 4 5 P1 TAT 19 14 15 9 8 7 P1 2 Average waiting time: 8.0 Average turnaround time: 13.0 **Output values are random and do not match the given input. P4 11 Burst Time P5 5 2 7 4 5 16 P3 23 P5 P2 P1 P3 P4 P3 P4

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)

An operating system uses a total of two units of the resource R for each of its three user processes. The operating system uses a total of 12 units of R. The absolute minimum number of R units that must be used to guarantee that there are no deadlocks is

Assume the memory contains 6 holes with the sizes of 190, 550, 220, 420, 650, and 110 A sequence of requests for 4 blocks is to be satisifed: A = 210, B = 430, C = 100, D = 420. The following table has two rows for each of the four memory allocation strategies (first fit, next fit, best fit, worst fit). Fill in the table as follows: Block Allocated: Enter the letter of the memory block that will be placed in the indicated hole. If more than one block is allocated in a hole, include both blocks with no spaces (e.g. "DG"). If no block is allocated in a hile, enter "-". • Remaining Size: Enter the size of the remaining hole after all four memory blocks are placed. H1: 190 H2: 550 H3: 220 H4: 420 H5: 650 H6: 110 Block First Fit Blank 1 Blank 2 Blank 3 Blank 4 Blank 5 Blank 6 Allocated Remaining Blank 7 Blank 8 Blank 9 Blank 10 Blank 11 Blank 12 Size Block Next Fit Blank 13 Blank 14 Blank 15 Blank 16 Blank 17 Blank 18 Allocated Remaining Blank 19 Blank 20 Blank 21 Blank 22 Blank 23 Blank 24…

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.