Ql: c) Consider the system with 5 processes and three resources types A=13, B=13 and C=9. The following information has been given. Allocation Matrix Маx A A B PO РО 3 2 4 PI 3 1 P1 3 5 1 P2 5 P2 7 7 P3 3 P3 5 5 P4 4 2 Р4 2 Available resources are A=3, B=4, C=0. i. Find need Matrix ii. Is the system in safe state?? (If yes find the safe sequence using Banker's Algorithm). 4. 2.

Ql: c) Consider the system with 5 processes and three resources types A=13, B=13 and C=9. The following information has been given. Allocation Matrix Маx A A B PO РО 3 2 4 PI 3 1 P1 3 5 1 P2 5 P2 7 7 P3 3 P3 5 5 P4 4 2 Р4 2 Available resources are A=3, B=4, C=0. i. Find need Matrix ii. Is the system in safe state?? (If yes find the safe sequence using Banker's Algorithm). 4. 2.

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 following snapshot of a system: Allocation Маx Available Process ABCD АВСD АВСD 2001 4212 332 1 PO P1 3121 5252 P2 2103 2316 P3 1312 1424 P4 1432 3665 Answer the following questions using the banker's algorithm: 1. How many instances of resources are present in the system under each type of a resource? 2. What is the content of the matrix Need? و ترغعب في أن يظهر منا.1 lingعمهاطل تخنسم اشرما مبريافحضلا نمر بياليا انتسي 3. Is the system in a safe state? (explain your answer) 4. If a request from process P1 arrives for (1,1,0,0), can the request be granted immediately? (explain your answer)
QUESTION TWO A. (i) Describe Banker’s algorithm for deadlock avoidance with supporting example (ii)Consider a computer system with has four identical units of a resource R. There are three processes each with a maximum claim of two units of resource R. Processes can request these resources in anyway, that is, two in one shot or one by one. The system always satisfies a request a request for a resource if enough resources are available. If the process doesn’t request any other kind of resource, show that the system never deadlock B. Give a solution for the following synchronization problem using semaphores (i)Producer- Consumer Problem (ii)Readers- Writers Problem C. List out the issues in preprocessor scheduling that causes performance degradation in multiprocessor systems
Consider the following snapshot of a system in which five resources A, B, C, D and E are available. The system contains a total of 2 instances of A, 1 of resource B, 1 of resource C, 2 resource D and 1 of resource E. Do the following problems:• Convert this matrix representation to a resource allocation graph.• Use the deadlock detection algorithm to determine whether the system contains a deadlock. Which processes are involved in the deadlock?• While you are use the deadlock detection algorithm, add and remove directed edges of the resource allocation graph.
1.5. Given the following state of system: the system comprises of four processes and three resouroes. P1-P4 denotes the set of processes R1- R3 denotes the set of resources Claim Matrix C RI R2 R3 P1 4 5 3 213 P2 P31 2 3 P4 Allocation Matrix A R1R2 R3 2 0 P2 Available Matrix V RI R2 R3 1.5.1 Compute the Resouroe vector R. 1.5.2 Compute the need Matrix Is the curent allocation state safe? If, give a safe sequence of the process. In addition, show how the Available (working array) changes as each 1.5.3 process temminates
Consider a system with five processes (P1-P5) and four resources (R1-R4) where R1 has 3, R2 has 8, R3 has 6 and R4 has 6 instances. By considering the snapshot of the system given below: a. What is the content of the matrix Need? b. What is the content of the vector Available? Allocation Max R1 R2 R3 R4 R1 R2 R3 R4 P1 1 1 2 P2 1 6. 5 2 P3 1 6 6 P4 1 1 P5 4. 1 7 6, 2. LO 3. 2. 3. 3.
Multiple question A set { P0, P1, Pn} of waiting processes must exist such that P0 is waiting for a resource held by P1, P1 is waiting for a resource held by P2, …, Pn-1 is waiting for a resource held by Pn, and Pn is waiting for a resource held by P0. This condition for deadlock is referred to as a. Hold and Wait b. Circular Wait c. Mutual Exclusion d. No Preemption
1. Consider a system with: five processes, PO → P4, three resource types, A, B, C. Type A has 10 instances, B has 5 instances, C has 7 instances. At time TO the following snapshot of the system is taken. Is the system in a safe state? Max Need Allocated Available A B A B C A C PO 7 5 3 2 P1 2 2 P2 9. 3 2 P3 2 2 1 1 P4 4 Is the system in a safe state? Write the steps, that leads to your conclusion. O3O2N23
Given 4 processes PO to P3, and 3 resource types: A (7 instances), B (3 instances), and C (5 instances). Suppose a snapshot taken for the system at time To as follows: Allocation Мах Available ABC ABC ABC Po 200 4 1 2 111 P1 10 1 1 1 2 P2 3 1 1 4 3 1 P3 0 1 2 3 2 4 A- Apply Banker's algorithm to determine if the system is in a SAFE or UNSAFE state? Note: show all the changes made to the available resources (work). B- If the system is safe, what is the execution sequence of processes that avoids deadlock? [if unsafe, just write NONE] C- To avoid deadlock, can a request for resources (1,2,0) by P2 be granted? why?
- Consider the following resource allocation graph. P, P. P, i) Convert it to the matrix representation (i.e., Find matrix for Allocation, request, and Available). ii) Is there a deadlock? If there is a deadlock, which processes are involved? What is the hold and wait condition for deadlock? Explain why violation of this condition is sufficient to prove that there is no deadlock among the set of processes even if mutual exclusion and no-preemption conditions are valid?
Given the following state of system: the system comprises of four processes and three resources. P1 – P4 denotes the set of processes R1 – R3 denotes the set of resources Claim Matrix C R1 R2 R3 P1 4 5 3 P2 3 2 3 P3 1 2 3 P4 1 0 2 Allocation Matrix A R1 R2 R3 P1 2 2 0 P2 3 2 0 P3 1 1 3 P4 0 0 2 Available Matrix V R1 R2 R3 0 3 2 Compute the Resource vector R. (08) Compute the need Matrix Is the current allocation state safe? If, give a safe sequence of the process. In addition, show how the Available (working array) changes as each process terminates.
Consider a system with five processes, PO →P4, three resource types, A, B, C. Type A has 9 instances, B has 6 instances, C has 6 instances. At time To the following snapshot of the system is taken. Available В С 1 Max Need Allocated A A PO 2 2 P1 7 C 1 2 1 4. 3 P2 4 2 P3 4 3 2 1 P4 3 2 (You may write down the steps and all answers in a paper and upload) a) Is the system in a safe state? b)Write the Sequence c)Calculate Need matrix d)Write the steps, that leads to your conclusion.
Consider the following snapshot of a system: Allocation Маx Available ABCD ABCD ABCD PO 2001 4212 3321 P1 3121 5252 P2 2103 2316 P3 1312 1424 P4 1432 3665 Answer the following questions using the banker's algorithm: a. llustrate that the system is in a safe state by demonstrating an order in which the processes may complete. b. If a request from process P1 arrives for (1, 1, 0, 0), can the request be granted immediately? c.Ifa request from process P4 arrives for (0, 0, 2, 0), can the request be granted immediately? Show transcribed image text