Consider the matrix tables below and answer the following questions: Claim Allocation Available B C D B C D A B A P1 4 7 5 P1 4 2 5 1 40 1 P2 4 1 P2 2 0 1 P3 1 3 1 2 P3 1 2 1 P4 9 4 2 3 P4 6 3 2 1 b) Is the system in a safe state? If yes, state the sequence of processes executed that will lead the system into a safe state. A52 A 5 WNACC 4 D321 C D

Consider the matrix tables below and answer the following questions: Claim Allocation Available B C D B C D A B A P1 4 7 5 P1 4 2 5 1 40 1 P2 4 1 P2 2 0 1 P3 1 3 1 2 P3 1 2 1 P4 9 4 2 3 P4 6 3 2 1 b) Is the system in a safe state? If yes, state the sequence of processes executed that will lead the system into a safe state. A52 A 5 WNACC 4 D321 C D

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 ABCD ABCD ABCD PO 2001 4212 3321 P1 3121 5252 P2 2103 2316 P3 1312 1424 P4 1432 3665 a. Illustrate that the system is in a safe state by demonstrating an order in which the processes may complete.
Consider the following snapshot of a system: Allocation Мах АВСD АВСD Ро 3014 5117 P1 P2 P3 2210 3211 3121 3321 0510 4612 P4 4212 6325 Using the banker's algorithm, determine whether or not each of the following states is unsafe. If the state is safe, illustrate the order in which the processes may complete. Otherwise, illustrate why the state is unsafe. a. Available = (0, 3, 0, 1) b. Available = (1,0, 0, 2) %3D
Banker’s Algorithm question Consider the following snapshot of a system: Using the banker’s algorithm, determine whether or not each of the following states is unsafe. If the state is safe, illustrate the order in which the processes may complete. Otherwise, illustrate why the state is unsafe. For each sub question, state whether it is safe or not and supply a safe order if safe. Illustrate why they are safe or not safe Available = (1, 0,0,1) Available = (1, 1, 0, 0)
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
Consider a computer system with three users: Alice, Bob, and Cindy. Alice owns file X, and Bob and Cindy can read it. Bob owns file Y, and Cindy can read and write the file Y, but Alice can only read it. Cindy owns file Z, but neither Alice nor Bob can read or write it. If a user owns a file, he/she can also execute the file. Create the ACM (access control matrix) of the system Show the ACL and CL of the ACM Now Cindy allows Alice to read Z, Alice removes Bob's ability to read X, and Bob removes all the rights of Alice and Cindy to Y. Show the ACM after these changes.
Consider a database buffer manager that uses 1GB of main memory andkeeps data on a hard drive which reads 100MB per second and takes 10 milliseconds per disk seek. (a) Assume that (1) the size of each disk block is 10KB and (2) for each block keptin the buffer, the probability that the buffer manager can handle the next data request usingthat block (i.e., the probability that the block contains the requested data) is 5 · 10-6. Inthis case, calculate the expected data access time (i.e., how much time the buffer manageron average would spend to provide a requested disk block). For this calculation, assume that(1) the buffer manager runs the algorithm explained in Section 13.5.1 of the textbook, (2) thebuffer is already full (i.e., the entirety of the 1GB buffer space is already used to hold 105 diskblocks), and (3) no disk blocks are updated (i.e., no need to write dirty blocks back to thehard drive). Also, ignore the time spent for reading/writing data in the main memory.(b) Assume…
Consider the following table of a system: Process Allocated Маx Available R1 R2 R3 R4 R1 R2 R3 R4 R1 R2 R3 R4 P1 1 1 1 2 1 2 P2 2 3 3 3 3 3002 P3 3 4 4 3 5 P4 2 5 4 6. P5 e. Compute NEED Matrix. f. Is the system in safe state? Justify 3. 3. 2. 3.
Consider a computer system with three users: Alice, Bob, and Cyndy. Alice owns the file alicerc, and Bob and Cyndy can read it. Cyndy can read and write the file bobrc, which Bob owns, but Alice can only read it. Only Cyndy can read and write the file cyndyrc, which she owns. Assume that the owner of each of these files can execute it. Create the corresponding access control matrix. Cyndy gives Alice permission to read cyndyrc, and Alice removes Bob's ability to read alicerc. Show the new access control matrix
The following table represents the present state of a system. Process Allocated Маx Available R1 R2 R3 R4 R1 R2 R3 R4 R1 R2 R3 R4 P1 4 2 2 P2 1 2 2 3 P3 1 1 1. Compute Need Matrix 2. Use Bankers algorithm to test if the system is in safe state or not. 3. Write the safe Sequence. 2. 1. 3.
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. Max Need Available Allocated |A В С A В С А В с 1 1 3 2 2 PO P1 2 7 2 4 1 P2 P3 P4 0 2 4 3 O 2 O 2 1. 20 5 3 3 3 2 0 (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 Мах АВCD АВCD Po P1 P2 P3 P4 3014 5117 2210 3211 3121 3321 0510 4612 4212 6325 Using the banker's algorithm, determine whether or not each of the following states is unsafe. If the state is safe, illustrate the order in which the processes may complete. Otherwise, illustrate why the state is unsafe. а. Available 3D (0, 3, 0, 1) b. Available = (1, 0, 0, 2) If a request from process P3 arrives for (3, 0, 2, 0), can the request be granted immediately?
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.