1. Consider the following snapshot of a system: Process PO P1 P2 P3 P4 A 0 1 1 0 0 Allocation B C 0 0 3 CHOS 3 D 0 ONONT 1 2 0 1 5 4 6 0 1 4 2 Max A 0 0 1 OON 2 BON 366 7 Answer the following questions using Banker's Algorithm: a) What is the content of the matrix Need? b) Is the system in a safe state? CLS555 ONO626 Available 0 с D А AL NO B с DO 1 5 2 0 c) If a request from process p1 arrives for (0,,4,2,0) can the request be granted immediately.

1. Consider the following snapshot of a system: Process PO P1 P2 P3 P4 A 0 1 1 0 0 Allocation B C 0 0 3 CHOS 3 D 0 ONONT 1 2 0 1 5 4 6 0 1 4 2 Max A 0 0 1 OON 2 BON 366 7 Answer the following questions using Banker's Algorithm: a) What is the content of the matrix Need? b) Is the system in a safe state? CLS555 ONO626 Available 0 с D А AL NO B с DO 1 5 2 0 c) If a request from process p1 arrives for (0,,4,2,0) can the request be granted immediately.

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

Given the following transaction database from a supermarket: Transaction ID items T1 I1, I2, I3 T2 I2, I3, I4 T3 I4, I5 T4 I1, I2, I4 T5 I1, I2, I3, I5 T6 I1, I2, I3, I4 What is the output of the Apriori algorithm run on the above transaction database with a minimum support of 50 % (i.e. 3 out of 6 transactions)? Calculate the following confidence: {I1, I2} => { I3} {I2} => {I1, I3} {I1, I3} => {I2} Calculate the following lift: {I2} => {I3} {I2} => {I4} {I1, I3} => {I2}
Answer the following questions using the Banker’s algorithm:a. What is the content of the matrix Needb. Is the system in a safe state? Explainc. If a request from process P1 arrives for (0,4,2,0), can the request be grantedimmediately? Explain
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…
Answer the following questions using the banker’s algorithm: a. What is the content of the matrix Need? b. Is the system in a safe state? c. If a request from process P1 arrives for (0,4,2,0), can the request be granted immediately?
Consider the following snapshot of a system: Allocation Max Available A B C D A B C D A B C DT0 3 1 4 1 6 4 7 3 2 2 2 4T1 2 1 0 2 4 2 3 2T2 2 4 1 3 2 5 3 3T3 4 1 1 0 6 3 3 2T4 2 2 2 1 5 6 7 5Answer the following questions using the banker’s algorithm:a. Illustrate that the system is in a safe state by demonstrating anorder in which the threads may complete.b. If a request from thread T4 arrives for (2, 2, 2, 4), can the request begranted immediately?c. If a request from thread T2 arrives for (0, 1, 1, 0), can the request begranted immediately?d. If a request from thread T3 arrives for (2, 2, 1, 2), can the request begranted immediately?
Consider the following snapshot of a system: Allocation Max Available A B C D A B C D A B C D P0 0 0 1 2 0 0 1 2 1 5 2 0 P1 1 0 0 0 1 7 5 0 P2 1 3 5 4 2 3 5 6 P3 0 6 3 2 0 6 5 2 P4 0 0 1 4 0 6 5 6 Answer the following questions using the banker’s algorithm: a). What is the content of the matrix Need? b). Is the system in a safe state? c). If a request from process P1 arrives for (0,4,2,0), can the request be granted immediately?
Consider the following snapshot of a system: Allocation Max Available A B C D A B C D A B C D T0 3 1 4 1 6 4 7 3 2 2 2 4T1 2 1 0 2 4 2 3 2T2 2 4 1 3 2 5 3 3T3 4 1 1 0 6 3 3 2T4 2 2 2 1 5 6 7 5 Answer the following questions using the banker’s algorithm: Illustrate that the system is in a safe state by demonstrating anorder in which the threads may complete. If a request from thread T4 arrives for (2, 2, 2, 4), can the request begranted immediately? If a request from thread T2 arrives for (0, 1, 1, 0), can the request begranted immediately? If a request from thread T3 arrives for (2, 2, 1, 2), can the request begranted immediately? Given six memory partitions of 100 MB, 170 MB, 40 MB, 205 MB, 300 MB, and 185 MB…
Suppose that a disk drive has 5,000 cylinders, numbered 0 to 4999. The drive is currently serving a request at cylinder 133, and the previous request was at cylinder 115. The queue of pending requests, in FIFO order, is:76,1460, 903, 1764, 938, 1499, 1012,1740,120. Starting from the current head position, what is the total distance (in cylinders) that the disk arm moves to satisfy all the pending requests for each of the following disk-scheduling algorithms? (a) FCFS (b).SSTF (c) SCAN (d) LOOK (e) C-SCAN (f) C-LOOK
Given the following information:Free Space ListPartition Size (KB) Queuing Processes Process Size (KB)A 500 P1 170B 350 P2 420C 150 P3 280D 400 P4 90E 350 P5 220F 200 P6 200 List of partitions and processes Show how these SIX (6) processes are allocated into memory partitions when the following allocation algorithms are applied. Give your answer using the following table format. Partition Partition Size Process Process size Internal Fragmentation…
Consider the following snapshot of a system: ALLOCATION MAX AVAILABLE A B C D A B C D A B C D P0 3 2 1 4 3 4 2 7 4 4 3 1 P1 2 5 4 3 4 7 7 6 P2 3 1 1 2 5 3 2 3 P3 2 4 2 3 2 5 3 5 P4 4 2 3 2 6 3 6 3 Answer the following questions using the banker’s algorithm: Illustrate that the system is in a safe state by demonstrating an order in which the processes may complete. If a request from process P4 arrives for (2,2,1,1), can the request be granted immediately? If a request from process P1 arrives for (1,1,3,1), can the request be granted immediately?
(i) Describe Banker’s algorithm for deadlock avoidance with supporting example 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 Give a solution for the following synchronization problem using semaphores Producer- Consumer Problem Readers- Writers Problem List out the issues in preprocessor scheduling that causes performance degradation in multiprocessor systems
Consider the following snapshot of a system: Allocation Max Available A B C D A B C D A B C D P0 2 0 0 1 4 2 1 2 3 3 2 1 P1 3 1 2 1 5 2 5 2 P2 2 1 0 3 2 3 1 6 P3 1 3 1 2 1 4 2 4 P4 1 4 3 2 3 6 6 5 Answer the following questions using the banker’s algorithm: a. Illustrate 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. If a request from process P4 arrives for (0, 0, 2, 0), can the request be granted immediately?