Consider a scenario of CSE Department where a department has aFaculty, a teaching assistant and a laboratory with 5 sitting positions.At a time, faculty visit only one student. After visiting a student,faculty calls for another student from the lab or takes rest (sleep sate)if the lab is empty. A student who wants to visit the faculty enters inthe lab and wait for his turn. If the lab is full he comes after sometime.Consider faculty and student as processes which should besynchronized. You are required to write the code for the processesusing semaphore. Your answer should consider the following points.(a) Write down the list of synchronization and critical systemproblems you have to solve.

The synchronization and critical system is explained as,

Answered: nother student from the laba 1. A…

Engineering

Computer Science

nother student from the laba 1. A student who wants to vi for his turn. If the lab is ful and student as process

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

The Harvard robotics club has organized a Robothon. n robots are placed alongthe edge of a circular area at the middle of the OAT(open air theatre). Each robot will move along arbitrary tracksinside the circle while leaving behind a heat signature along its trail. However, they have beenprogrammed not to cross their own trail or the trail of another robot, neither will they ever moveout of the circle. In case a pair of robots i and j meet at any point, they are removed from the sceneand the club will pay a reward sum of M[i, j] to the owners of these robots. Note that some robotscan keep moving infinitely without ever meeting another one. Given the reward matrix M whereM[i, j] = M[j, i], design a polynomial time algorithm that determines the maximum money theclub might potentially end up spending. For this particular problem, give a very brief justificationof the recurrence. Give pseudo-code for a dynamic program which solves the recurrence efficiently Youdo not need to prove…
We can implement requests to the waiter as either a queue of requests or as a periodic retry of a request. With a queue, requests are handled in the order they are received. Th e problem with using the queue is that we may not always be able to service the philosopher whose request is at the head of the queue (due to the unavailability of resources). Describe a scenario with 5 philosophers where a queue is provided, but service is not granted even though there are forks available for another philosopher (whose request is deeper in the queue) to eat.If we implement requests to the waiter by periodically repeating our request until the resources become available, will this solve the problem described in the above Exercise? Explain.
In a prison, there is a door b/w any pair of adjacent cells and one exit guarded by a guard G. One prisoner is a maniac M which kills anybody he can see when he enters a cell. If M returns to the cell with his victim, then he loses consciousness and stops. In the evening all inmates and the guard went to sleep in their cells. In the morning, maniac M is gone and all other prisoners with the guard were found dead in their cells. Show the route of the maniac.
In a private university, students can enrol for at least 1 to a maximum of 5 subjects in a semester. Subjects that are to be offered in that particular semester will be assigned to a class. One class should have at least 5 students and up to a maximum of 40 students. Multiple classes for a subject can be created if the students number enrolled for the subject is large. A subject might not be offered on that semester depending on the needs. A lecturer can be assigned to zero and up to a maximum of 4 classes on that particular semester. Draw the class diagram to represent the above scenario. Each entity should have at least 1 attribute as its identity. Provide the relevant associations between these entities and include the multiplicities.
Five philosophers are sitting at a round table. In the center of the table is a bowl of rice. Between each pair of philosophers is a single chopstick. A philosopher is in one of the three states: thinking, hungry or eating. At various times, a thinking philosopher gets hungry. A hungry philosopher attempts to pick one of the adjacent chopsticks, then the other (not both at the same time). If the philosopher is able to obtain the pair of chopsticks (they are not already in use), then the philosopher eats for a period of time. After eating, the philosopher puts the chopsticks down and returns to thinking. Write a monitor for the dining philosopher’s problem.
The Cigarette-Smokers Problem. Consider a system with three smoker processes and one agent process. Each smoker continuously rolls a cigarette and then smokes it. But to roll and smoke a cigarette, the smoker needs three ingredients: tobacco, paper, and matches. One of the smoker processes has paper, another has tobacco, and the third has matches. The agent has an infinite supply of all three materials. The agent places two of the ingredients on the table. The smoker who has the remaining ingredient then makes and smokes a cigarette, signaling the agent on completion. The agent then puts out another two of the three ingredients, and the cycle repeats. A program to synchronize the agent and the smokers is given below. Note that the ingredients produced by the agent are represented by i and j and those needed by the smokers are represented by r and s. Which of the following should be used to fill the first missing part of the smoker process?
"Semaphore' may be used also to control the flow of execution. Consider the following situation: P and P2 are two concurrent processes; P executes statement si and P2 executes statement s2. Use semaphores with the wait() and the signal() system calls to impose this flow of execution: s1 must be execute AFTER s2. Make a simulation to justify your answer (no point without a valid simulation).
The Cigarette-Smokers Problem. Consider a system with three smoker processes and one agent process. Each smoker continuously rolls a cigarette and then smokes it. But to roll and smoke a cigarette, the smoker needs three ingredients: tobacco, paper, and matches. One of the smoker processes has paper, another has tobacco, and the third has matches. The agent has an infinite supply of all three materials. The agent places two of the ingredients on the table. The smoker who has the remaining ingredient then makes and smokes a cigarette, signaling the agent on completion. The agent then puts out another two of the three ingredients, and the cycle repeats. A program to synchronize the agent and the smokers is given below. Note that the ingredients produced by the agent are represented by i and j and those needed by the smokers are represented by r and s. Which of the following should be used to fill the first missing part of the smoker process? In the Cigarette-Smokers Problem described…
Illustrate with simulation examples and describe the situation for Di < Ti . Show that the necessary and sufficient condition becomes only the necessary condition and is no longer the sufficient condition.
A queueing system has 1 server and two phases. The interarrival time is uniform between 20 and 50 seconds. The service times of the first phase is exponential with an average of 75 seconds, and the second phase exponential with an average of 90 seconds. Use a simulation run length of 1,000 arrivals. Explain what is the point estimate for the total number of customers and the time they will spend in the system?
Every patient has a primary physician. Every doctor has at least one patient. Each pharmacy sells several drugs and has a price for each. A drug could be sold at several pharmacies, and the price could vary from one pharmacy to another. Doctors prescribe drugs for patients. A doctor could prescribe one or more drugs for several patients, and a patient could obtain prescriptions from several doctors. Each prescription has a date and a quantity associated with it. You can assume that, if a doctor prescribes the same drug for the same patient more than once, only the last such prescription needs to be stored. Pharmaceutical companies have long-term contracts with pharmacies. A pharmaceutical company can contract with several pharmacies, and a pharmacy can contract with several pharmaceutical companies. For each contract, you have to store a start date, an end date, and the text of the contract. Pharmacies appoint a supervisor for each contract. There must always be a supervisor for each…
Implement an algorithmic solution, indicating which states are valid and which are not, and model the space of the following problem: An interest group from a small town decided to sue a company for commercial abuse. For this, the people have organized themselves and decided to send 3 representatives, who will have to travel in a Van to the city where the lawsuit will be filed. The company to be sued, upon learning of these actions, has decided to send 3 lawyers to persuade the representatives, who will also travel in the same Van for that purpose. The community must file the class action suit under these conditions: - The three applicants must reach the destination city; - Only two people can travel per trip in the Van (small town - city, city - small town); - There can never be more lawyers than plaintiffs in any one place (either in the small town or city) because the lawyers can persuade the plaintiffs and as a consequence, the lawsuit would not be made; - The Van cannot be…