Points Possible 40
php代码代写 1.Consider you ASU ID and repeat it twice. You will get a 20 digit number. This number is your page request string. Page numbers start from···
php代码代写
1.Consider you ASU ID and repeat it twice. You will get a 20 digit number. This number is your page request string. Page numbers start from 0 and can be a maximum of 9. Consider two scenarios: a) 5 frames and b) 4 frames. Show the table of page faults as discussed in class for FIFO, Farthest in the Future and Least Recently Used page replacement algorithms. [18 points]
2.If your ASU ID is odd then attempt 2a else (including 0) attempt 2b [12 points]
a.Consider that there are four resources and five processes. The maximum number of resource instance available to the system are:
Max Available = 6 8 7 6
For the processes the maximum that they can request are:
Max php代码代写
P1 1 4 3 3
P2 3 3 2 3
P3 4 4 2 5
P4 2 1 5 3
P5 3 6 1 1
Consider a state where the processes have the following allocations:
Alloc php代码代写
P1 1 2 1 1
P2 0 2 1 2
P3 2 0 2 1
P4 0 1 1 0
P5 0 0 1 0
Is this a safe state? (show your work, if no work shown points will be deducted later manually)
If you answered true, then provide a sequence of need requests from processes that will help avoid a deadlock scenario. If the needs of two processes can be met at a time then choose the process with the lower number. Write your answer in the form of a number for example if you thought that the need for P1 should be addressed first then P2, then P3, then P4 and then P5, please enter 12345. If you answered false in the previous question just type in 0. Show your work.
Now assume that a request (0, 2, 0, 1) comes from P5. php代码代写
Can it be immediately granted without risking deadlock?
In the previous question, if you answered true, then provide a sequence of need requests from processes that will help avoid a deadlock scenario. If the needs of two or more processes can be met at the same time then choose the process with the lower number. Write your answer in the form of a number for example if you thought that the need for P1 should be addressed first then P2, then P3, then P4 and then P5, please enter 12345. If you answered false in the previous question just type in 0. (Show your work)
1.Consider that there are four resources and five processes. The maximum number of resource instance available to the system are:
Max Available = 4 11 9 8
For the processes the maximum that they can request are:
Max php代码代写
P1 1 4 3 3
P2 3 3 2 4
P3 1 7 3 6
P4 2 1 5 3
P5 3 6 1 1
Consider a state where the processes have the following allocations:
Alloc
P1 0 2 1 1
P2 0 1 1 2
P3 1 0 2 3
P4 0 1 0 1
P5 0 0 1 0
How will you classify this state? php代码代写
(show your work, if no work shown points will be deducted later manually)
If your answer is safe state, please provide a sequence of execution of the processes such that all the needs are met. If you think that the process sequence is P1, P2, P3, P4, P5 please enter 12345. If the needs of two processes i and j can be satisfied at the same time then execute i first if i < j.
If you think that the process is unsafe. Then enter the sequence in which processes that can be executed before a deadlock occurs. If you think that process sequence P1 and P2 can be executed before a deadlock occurs then enter 12. If you think that no processes can be executed then enter 0. (Show your work)
Consider that there are four resources and five processes. The maximum number of resource instance available to the system are:
Max Available = 4 11 9 10 (Note that Max has changed from the previous question)
For the processes the maximum that they can request are:
Max php代码代写
P1 1 4 3 3
P2 3 3 2 4
P3 1 7 3 6
P4 2 1 5 3
P5 3 6 1 1
Consider a state where the processes have the following allocations:
Alloc
P1 0 2 1 1
P2 0 1 1 2
P3 1 0 2 3
P4 0 1 0 1
P5 0 0 1 0
Consider now that a request of {0, 6, 0, 0} arrives from Process P3. php代码代写
Can it be immediately given without leading to deadlock? (Show your work)
If your answer to the previous question is true, please provide a sequence of execution of the processes such that all the needs are met. If you think that the process sequence is P1, P2, P3, P4, P5 please enter 12345. If the needs of two processes i and j can be satisfied at the same time then execute i first if i < j. If your answer to the previous question is false enter 0. (Show your work on worksheet. No work no points)
更多代写：C#程序代写 财务代考 lab代写 arts essay代写 网络安全 CS计算机代考
