1) For the Peterson solution find a situation using pre-emption where both process get intobusy wait situation.#define N 2#idefine TRUE 1#define FASE Oint interested [N] = FALSE;int turn;void Entry-section(int process)int other;other = 1-process;interested[process] - TRUE;turn - process;while(interested[other]=TRUE && turn = process);[CRITICAL SECTION]void Exit section(int process)interested[process] = FALSE;2) For the sleep and wake algorithm find a situation using pre-emption where both producerand consumer fall asleep.#define N 100#define count=0void producer (void)void consumer(void)int item;while(True){item = produce_item();if(count =- N)sleep();insert_item(item);count = count+1;int item;while(True){if(count == 0)sleep();item=removeitem();count = count -1;if(count=-N-1)wake_up(producer);consumer_item(item);if(count==1)wake_up(consumer);

As per our guidelines we are supposed to answer only one question. Kindly repost other question as a…

1) For the Peterson solution find a situation using pre-emption where both process get into busy wait situation. adefine N 2 adefine TRUE 1 ndefine FASE e int interested [N] = FALSE; int turn; void Entry-section(int process) int other; other - 1-process; interested[process] - TRUE; turn - process; while(interested other]-TRUE 8& turn = process); [CRITICAL SECTION] void Exit section(int process) interested[process] = FALSE;

1) For the Peterson solution find a situation using pre-emption where both process get into busy wait situation. adefine N 2 adefine TRUE 1 ndefine FASE e int interested [N] = FALSE; int turn; void Entry-section(int process) int other; other - 1-process; interested[process] - TRUE; turn - process; while(interested other]-TRUE 8& turn = process); [CRITICAL SECTION] void Exit section(int process) interested[process] = FALSE;

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

Course Title: Object Oriented Analysis and Design Question : There is a utility company which provides waste management services to citizens. It has a CRM system, billing system, messaging system and mapping (GIS) system. When a customer is created in the CRM system, the billing, messaging, and GIS systems need a copy of customer data to perform follow-up tasks and automation. For instance—the billing system will create a billing account for the customer, the messaging system will send a welcome message with customer account details on preferred communication channel and the GIS system will update the customer’s address in the database for mapping purposes. After completion of one billing cycle the billing dept. sends a copy of the bill in a pdf format on the customer email address and the bill amount is directly debited from the customer’s bank account. Draw an appropriate Activity diagram . (Note): Forks and joins have the same notation: either a horizontal or vertical bar (the…
9. Let S = {{a}, {b}, {c}, {a,b}, {a, c}, {b, c}}. Construct the Hasse diagram for (S, C).
(b) KLM-GOMS stands for Keystroke-Level Model for Goals, Operators, Methods, and Selection rules. It allows designers to predict how long it will take a skilled user to execute a specific set of actions using a particular interface design. The standard set of operators are: • Keying (K): for typing a key or clicking a control - 0.2s Pointing (P): pointing with a mouse to a target on a display - 1.1s • Homing (H): home hands on keyboard or other input device - 0.4s Mentally Preparing (M): think before doing an action - 1.35s Responding (R): time a user must wait for a response Once you determine the operators, you need to apply the following rules for mental operations before calculating the time. Rule 0: Add Ms in front of all Ks and all Ps that point to commands. Rule 1: Change PMK to PK to remove fully anticipated Ms. Rule 2: Eliminate any Ms in the middle of strings that are part of a cognitive unit (a contiguous sequence of typed characters). Rule 3: Delete Ms before consecutive…
Pls create a case problem
Question 11 Given the following Rust-like program, answer the following questions. • Assuming static scoping rules, the value of x that is printed after fun3 is called will be Assuming dynamic scoping rules, the value x that is printed after fun3 is called will be let x = 5;//Global fn fun1(){ printin! ("%d", x); fn fun2(){ X += 1; fun1(); fn fun3(){ let x = 1; fun2(); //Program starts here. fn main(){ fun3();
Does the following yacc specification contain any conflicts? If there is a conflict, indicate the type of the conflict, the rules and the token that causes the conflict. Otherwise, explain your reasoning for concluding the absence of conflicts. Stoken X YZ s: ( printf("Going to Y"); ) tmp Y I{ printf("Going to 2"): ) tmp 2 tmp: X;
PROBLEM STATEMENT: Square a number and return the resulting product. public class SquareANumber{public static int solution(int x){// ↓↓↓↓ your code goes here ↓↓↓↓return 0; Can you help me with this code The language is Java
Draw a UML activity diagram describing the code snippet below. int arr[4]; arr [0] = 1; for (k=1; k< 4; k++ ) { arr[k] = } 3* arr[k-1]+ 1;
1. Problem Domain
Dissect the many approaches to handle deadlocks
You are required to use any OOP language(Java or any other) to create programs that contain different types of coupling that is: 1) Content Coupling , 2) Common Coupling, 3) Control Coupling, 4) Stamp Coupling, 5) Data Coupling . Please insert screenshots of the program and also describe that where and how a particular type of coupling exist in the program.
Language: C++ Design and write an object oriented program for the computation of the volume of boxes (having a height, a width and a depth as double values). Your solution should have methods for setting and getting the height, the width and the depth of a box as well as constructors (a default con- structor and one which sets the data members), a copy constructor and a destructor. files testbox.cpp, Box. cpp and Box.h. The program testing your code (testbox.cpp) should do the following: Name your a) Enter from the keyboard the a value for n, the number of boxes that will be entered. b) Dynamically create an array of 2*n boxes. c) Enter from the keyboard the height, width and depth of each box one after the other for the first n boxes and the add their copies on the remainder n positions (in the same order). Use the copy constructor for doing this. d) Loop across all boxes, calculate and print on the screen the volume of each box. You can assume that the input will be valid.