Suppose there are two Processes B1 and B2. There is one instance of Resource R1 and two instances of R2. •81 holds Resource R1 and requesting for Resource R2. • B2 holds Resource R2 and requesting for Resource R1. Consider the scenario in terms of Deadlocks. You may consider drawing a Resource Allocation Graph for the above scenario. (No Upload.Only write answers for a) and b) in the box given below) a) What kind of situation does the graph shows (Deadlock or No Deadlock)? b) Justify(reason) your answer to question (a).

Suppose there are two Processes B1 and B2. There is one instance of Resource R1 and two instances of R2. •81 holds Resource R1 and requesting for Resource R2. • B2 holds Resource R2 and requesting for Resource R1. Consider the scenario in terms of Deadlocks. You may consider drawing a Resource Allocation Graph for the above scenario. (No Upload.Only write answers for a) and b) in the box given below) a) What kind of situation does the graph shows (Deadlock or No Deadlock)? b) Justify(reason) your answer to question (a).

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

Abstract: the main purpose of this experiment is build real time system using PPI 8255 to control devices connected to. Problem description: assume that there are two devices are connected to port A and two sensors are connected to port B of PPI 8255. They work according to the following table Devices (DID2) 01 10 Sensors (S1S2) 00 01 10 11 11 00 Write a program to control these two devices according to the values of sensors. Each group should submit a zip file which contains the following files Code file: (assembly language code) - Simulation file Report (pdf file) (details of every single step in the code, also what have you learned from this experiment)
Draw this scenario on a piece of paper and answer what is required on the next items, upload an image of your graph here. A system has three processes (P1, P2, P3) and three reusable resources (R1, R2, R3). There is one instance of R1, two instances of R2 and three instances of R3. P1 holds an R1 and an R3 and is requesting an R2. P2 holds an R3 and is requesting an R1 and an R2. P3 holds two R2 and an R3 and is requesting an R1. (rating in this item will be manually encoded by the instructor upon checking)
A transaction database is a set of transactions completed in a supermarket database. Each transaction is a set of items. For example, consider the following transaction database. It contains 5 transactions (t1, t2, ..., t5) and 5 items (1,2, 3, 4, 5). For example, the first transaction represents the set of items 1, 3 and 4. It is important to note that an item is not allowed to appear twice in the same transaction and that items are assumed to be sorted by lexicographical order in a transaction. Transaction id Items t1 {1, 3, 4} t2 {2, 3, 5} t3 {1, 2, 3, 5} t4 {2, 5} t5 {1, 2, 3, 5} What is the output of the Apriori algorithm run on the previous transaction database with a minimum support of 40 % (2 out of 5 transactions)?
In java programming language An airport is developing a computer simulation of air-traffic control that handles events such as landings and takeoffs. Each event has a time stamp that denotes the time when the event will occur. The simulation program needs to efficiently perform the following two fundamental operations: • Insert an event with a given time stamp (that is, add a future event). • Extract the event with smallest time stamp (that is, determine the next event to process). Question 3 3.1 Which data structure should be used for the above operations? Why? 3.2 Write an application that adds the following time stamp in the selected data structure. Event1 occurs at 12:00:54 Event2 occurs at 10:40:54 Event3 occurs at 11:30:45 Event4 occurs at 12:00:00 3.3 Write a method that extracts the smallest time stamp. 3.4 What is the maximum running time
Part(a): What is a Deadlock? How it is detected? What are the necessary conditions for a deadlock to occur? Part(b): Suppose there are two resources available and the initial value of semaphore is set to 3.Consider a situation where P() and V() functions are called as follows. P(), P(), V(), V(), P(), P(), V(), P(), P(), V(), P(),P(),P(),V() Answer the following: 1. How many processes are sleeping on P ()?What is the value of semaphore? 2. How may processes have successfully completed their execution? 3. How many resources are available?
Provide the correct solution. The task is similar to the producer–consumer problem. The farmer and Shopowner share a fixed-size buffer named warehouse used as a queue. The farmer’s job is to harvest crops(Rice=R, Wheat=W, Potato=P, Sugarcane=S, Maize=M) and put this in the warehouse. Imagine that warehouses have different rooms for different crops. The Shopowner’s job is to take the crops from this wearhouse and make that crops room empty(=N).You have 5 Farmers and 5 Shop Owners You need to modify the following C code: #include <pthread.h> #include <semaphore.h> #include <stdio.h> /* This program provides a possible solution using mutex and semaphore. use 5 Farmers and 5 ShopOwners to demonstrate the solution. */ #define MaxCrops 5 // Maximum crops a Farmer can produce or a Shpoowner can take #define warehouseSize 5 // Size of the warehouse sem_t empty; sem_t full; int in = 0; int out = 0; char crops[warehouseSize]={'R','W','P','S','M'}; //indicating room for…
Computer science. Correct answer will be upvoted else downvoted. Development of the exhibit in William's cell machine happens iteratively in the accompanying manner: In the event that the component is dead and it has precisely 1 alive neighbor in the present status of the exhibit, then, at that point, on the following emphasis it will become alive. For a component at list I the neighbors would be components with files i−1 and i+1. In case there is no component at that list, it is viewed as a dead neighbor. William is a sympathetic individual so all alive components stay alive. Check the note area for instances of the advancement. You are given some underlying condition, everything being equal, and you really wanted to help William discover the condition of the cluster after m emphasess of advancement. Input Each test contains various experiments. The principal line contains the number of experiments t (1≤t≤103). Depiction of the experiments follows. The primary…
Consider the following table as a snapshot of resources in a system: A (10 instances), B (5 instances), and C (7 instances). a) Write down the calculation steps to find a Safe/Unsafe state: b) Is this system in a safe state? If so, write the safe sequence. Allocation Max Available АВС АВС 332 Po P1 P2 P3 PA 010 753 200 322 302 902 211 222 002 433
Read carefully this description before you answer this problem. We have 5 pages to be printed. We call the task of printing those five pages a Job, named J. Each of the subtasks is J1,J2,J3,J4,J5 that corresponds to the printing of an individual page, and thus J contains J1-J5. Start time is t=0 for all jobs. Job J completes when all jobs J1,J2, J3, J4,J5 get completed. Pages are printed one at a time. Preparing a single page to print takes 3s of instruction execution by the CPU. Printing it afterwards takes only printer time of 7s. If an interrupt handling mechanism is used, after the printer completes the printing of the relevant page 1s is spent for interrupt handling by the CPU. Interrupt handling has priority over other processor tasks and it is considered overhead. (1) What is the turnaround time in s for J when Blocked I/O (also known as Programmed I/O) is being used? (2) What is the turnaround time in s for J when interrupt-based I/O is being used?
Write a program that simulates a toy paging system that uses the WSClock algorithm. The system is a toy in that we will assume there are no write references (not very realistic), and process termination and creation are ignored (eternal life). The inputs will be: The reclamation age threshhold The clock interrupt interval expressed as number of memory references A file containing the sequence of page references Describe the basic data structures and algorithms in your implementation. Show that your simulation behaves as expected for a simple (but nontrivial) input example. Plot the number of page faults and working set size per 1000 memory references. Explain what is needed to extend the program to handle a page reference stream that also includes writes.
QUESTION 5 The Towers of Hanoi game starts with a pile of disks with different sizes on one of three pegs. The other two pegs start empty. The disks are initially piled in order of size with largest on the bottom. The aim of the game is to transfer all of the disks to a destination peg by moving one disk at a time, never placing a disk on top of a smaller one. The spare peg may be used for intermediate moves. One solution to the problem recursively moves all but the largest disk to the spare peg, moves the largest disk to the destination peg, and then recursively moves all the other disks from the spare peg to the destination peg. This process is described by the following pseudocode: Hanoi( n, start, destination, spare ) // n is the number of disks and start, destination and spare are peg numbers if n>0 Hanoi( n-1, start, spare, destination) moveTopDisk( start, destination) // move top disk on start peg to destination peg Hanoi( n-1, spare, destination, start) Which of the following…
Write on paper and submit a picture. Remember arrow directions are read when the point at a subject and write when they point at the object. 1. Alice and Bob are two users. Exam.docx and Solution.dox are two files with the given access rights. {Exam.docx, (Bob, ), (Alice, )} {Solution.docx, (Bob, ), (Alice, ) Based on this specification, draw an Information flow graph.