For the resource graph below, answer the following questions:R1R2P1POP2P3R3(1) What is P's eument allocatal roarces?(2) What is PI' current allocatad resources?(3) What is P2s current allocated researces?(4) What is P3's current allocated resources?(5) What is PO's current requested resources?(6) What is PI's current requested resources(7) What is P2's current requested resources?(8) What is P3's current requested resources?Put your anwwer in the falowing blanka, one per blank, from left to right.Nate: for all queationa, answer them in RI2RS ander. For esample, if your answer isRI-1, K2-0, and d-1, you need to type 101 in the comesponding blank, no spacesor comma between the armwer.

The resource graph given is :- P0 has resource r1 and r3 and waiting for r2 P1 has resource r1 and…

he Nure graph below llwing esls R1 R2 P1 PO P2 P3 R3 (1) What in Ps curent allestel neunce (2) What i PIs current allcated ource (3) What is P2s current allocated resurce (4) What is P3's cunent alocated resources? (5) What is PO's current requested resources? (6) What is PI's current requested resources? (7) What is P2's eurrent reguested reource (8) What is P3's ourrent requested resources? Pat your anwer in the falowing blanks, ane pr blank, from left to right. Nate fer al tion, er them in RI ender. Far enample, if your aner i R-1, 2-0, and-1. you need to tye 101 in the comesponding blank, no spaces ar emma behween the ae

he Nure graph below llwing esls R1 R2 P1 PO P2 P3 R3 (1) What in Ps curent allestel neunce (2) What i PIs current allcated ource (3) What is P2s current allocated resurce (4) What is P3's cunent alocated resources? (5) What is PO's current requested resources? (6) What is PI's current requested resources? (7) What is P2's eurrent reguested reource (8) What is P3's ourrent requested resources? Pat your anwer in the falowing blanks, ane pr blank, from left to right. Nate fer al tion, er them in RI ender. Far enample, if your aner i R-1, 2-0, and-1. you need to tye 101 in the comesponding blank, no spaces ar emma behween the ae

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Consider the Follow Resource allocation Graph: T₂ T₁ R₁ R₂ Deadlock Present. O No Deadlock Present: T4, T1, T3, T2 Does this set of tasks contain a deadlock? If not what is a valid order of executions of tasks? T3 O No Deadlock Present: T1, T2, T3, T4 No Deadlock Present: T3, T1, T4, T2 TA
QUESTION 2 Assume that there are : • 3 processes P1, P2, & P3 o 3 Resources R1( two instances), R2 (one instance), & R3 (two instances) And the processes make the requests for resources in the following order: o Pl requests R1 o P2 requests R2 o Pl requests R2 o P3 request R3 • P3 Request R2 o P2 request R3 Draw the resource allocation graph and find whether deadlock exists? Justify your answer.
Suppose there are four processes and four resource types in a system that avoids deadlockusing Bankers algorithm. The total amount of each resource type is given by the vector[16, 5, 2, 8].the current allocation and claim is given below. process Current Allocation Max Claim A B C D A B C D P1 P2 P3 P4 4 0 0 1 1 2 1 0 1 1 0 2 3 1 1 0 4 6 7 1 4 3 5 1 13 5 2 7 6 1 3 1 a. Illustrate this state is safe?b. Find out 2 possible safe sequences by using Bankers algorithm. ( SUBJECT:operating system)
Suppose there are four processes and four resource types in a system that avoids deadlock using Bankers algorithm. The total amount of each resource type is given by the vector [16, 5, 2, 8].the current allocation and claim is given below. Processes Current Allocation Max Claim A B C D A B C D P1 4 0 0 1 4 6 7 1 P2 1 2 1 0 4 3 5 1 P3 1 1 0 2 13 5 2 7 P4 3 1 1 0 6 1 3 1 a. Illustrate this state is safe? b. Find out 2 possible safe sequences by using Bankers algorithm. (operating systems concepts)
When a deadlock has been identified, the requested resources are made available to those who are unable to go forward.
There are 3 resources R1, R2 and R3 with one instance each and three processes P1, P2 and P3 in an operating system. A snapshot of the system resource allocation graph shows the following: R1 is allocated to P2; R2 is allocated to P1; R3 is allocated to P3; P1 requests R1; P2 requests R3; P3 requests R2. Which of the following is true about this system? answer ) a)Undetermined b)There is deadlock in the system c)Deadlock will never happen d)There is no deadlock in the system
Which of the six resource-allocation graphs shown in the figure illustrates deadlock? (a) U (e) T₁ R₁ T T₂ T₂ T4 T3 R₂ T3 R₂ (b) (d) T₁ R₁₂ T3 43 R₂ T₂ R₂ 5₂2 T₂ 5 T3 R3 R₂ .. R3
Is the following statement true or false and explain your answer, which supports the false, or true: A critical resource is a shared resource that at times may be preempted?
What is the difference between static and dynamic resource allocation?
Q.No.4: Draw a Resource Allocation Graph (RAG) for a given scenario and find that whether it contains a deadlock or not. Find all cycles in the RAG. Resources: Printer (R1), Hard Disk (R2), CPU (R3) and RAM (R4) Processes: MS Excel (P1), MS Word (P2), Media Player (P3) and Calculator (P4) · Resources: Printer = 1, Hard Disks = 2, CPU = 1, RAM = 1 · MS Excel Holds Printer and wait for CPU and RAM. · MS Word holds Hard Disk and RAM and waits for Printer and CPU. · Media Player waits for Hard Disk. · Calculator holds CPU. Write cycles in RAG if any?
Assume the following scenario. Resource instances One instance of resource type R1 One instance of resource type R2 One instance of resource type R3 One instance of resource type R4 One instance of resource type R5 One instance of resource type R6 Process states Process P1 is holding R2 and is waiting for an instance of resource type R1 Process P2 is holding an instance of R1 and is waiting for an instance of R3, an instance of R4 and an instance of R5. Process P3 is holding an instance of R4 and is waiting for an instance of R5. Process P4 is holding an instance of R5 and is waiting for an instance of R2 and R6 Process P5 is holding an instance of R3 and waiting for R6. Design a Resource Allocation Graph and determine the Wait-for-Graph. Also, identify if there is an occurrence of deadlock state among the processes.
Following is the order in which task requests with a priority of execution are received by a job scheduler. The priority of task execution increases with a greater priority value.Work ID: 464 212 110 840 976 3433 2 3 1 2 2 priorityCreate a treasury for the upcoming tasks. How would the treap appear once the top priority jobs had finished running and left the treap?