There are four concurrent processes W, X, Y and Z sequence. All have a shared variable 'c'. W and X work as follow reads c from memory, increment by one, store c in memory. Y and Z work as follow reads c from memory, decrement by two, stores into memory. Each process of the four call wait on semaphore s before reading, and calls signal after storing. If semaphore s = 1, what is the maximum value of c after all four processes complete execution? Select one: a. 2 b. -2 c. 1 d. -1

There are four concurrent processes W, X, Y and Z sequence. All have a shared variable 'c'. W and X work as follow reads c from memory, increment by one, store c in memory. Y and Z work as follow reads c from memory, decrement by two, stores into memory. Each process of the four call wait on semaphore s before reading, and calls signal after storing. If semaphore s = 1, what is the maximum value of c after all four processes complete execution? Select one: a. 2 b. -2 c. 1 d. -1

Name: Alert dont submit AI generated answer. There are four concurrent proce
Uploaded: 2024-03-20T06:51:23.000Z
Channel: Bartleby
Description: Alert dont submit AI generated answer. There are four concurrent processes W, X, Y and Z sequence. All have ashared variable 'c'. W and X work as follow reads c from memory, incrementby one, store c in memory. Y and Z work as follow reads c from memo

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

Write a C program which creates two childprocesses. One of the child processes mustopen data1.txt and fill it with 10 randomintegers (0-9). The other child process mustopen data2.txt and fill it with 10 randomletters (a-z). In the meanwhile, parent mustprint both child processes' id's and wait forthem to finish.
In this project you are to design a process queue that is responsible for handling the process requests coming from different users. You have to take into consideration that users have different levels of privileges and priorities. Each user has an identification number and a password, in addition to process priorities. One good idea is to design the queue using an array or pointers while preserving the first-in first-out concept of the queue. For every process request received, the program should check the privileges of that request and whether it can be moved forward in the queue to be served by the operating system prior to serving the other requests. Using the programming language of your choice (preferably C+), write the process queue that would handle the user request. The program must allow for requests coming from different users or from one user.
Student information is being held in a data area, where each student record has the following format: The first nine bytes are the student number, held in ASCII The next byte is the course mark The next word is the section identifierThere are well over three hundred such student records that have been loaded sequentially into memory starting at address $10000. The last record loaded is a dummy record with a section identifier of $FFFF, to show the end of the records.Write an assembler subroutine GetMax that will scan the entire list and find the highest mark. If there is a tie, the first student in the list with the highest mark should be found. The subroutine should return the starting address of this record in address register a3.
The Fibonacci sequence begins with 0 and then 1 follows. All subsequent values are the sum of the previous two, for example: 0, 1, 1, 2, 3, 5, 8, 13. Complete the fibonacci() function, which takes in an index, n, and returns the nth value in the sequence. Any negative index values should return -1 Ex: If the input is: 7 the output is: fibonacci (7) is l3 Note: Use recursion and DO NOT use any loops.
Write a C or C++ program that performs runs of the following process scheduling algorithms: *Shortest remaining time (SRT) [preemptive] *Round robin (RR) [preemptive] Run each scheduling algorithm for 100 quanta (time slices), labeled 0 through 99. Before each run of an algorithm, create 20 simulated processes. Each simulated process is simply a small data structure that stores information about the process that it represents. For each simulated process, randomly generate: • An arrival time: a float value from quanta 0 through 99. • An expected total run time: a float value from 0.1 through 10 quanta. • A priority: integer 1, 2, 3, or 4 (1 is highest) • Include any other attributes that you may need Tip: While debugging your program, you may want the same pseudo-random numbers each time. For this to happen, you should set the seed of the random number generator to a value, such as 0. Read about the rand() and srand() functions for C and C++: Assume only one CPU and one ready queue.…
The same professor writes a program to analyze the chat logs from the various lectures as a partial measure of class participation. Each chat log consists of multiple lines, each of form TIME, NAME, COMMENT, in the order in which they were posted to the chat . The algorithm then sorts all that data - across all the chat logs - in order of student names, and scores each set using a metric based on the number of contributions and their length. [a] What are the various input sizes to consider when analyzing the algorithmic approaches? (One is the number of students in the class, but that is not the only factor.) [b] Which sorting algorithm do you think is best suited for the sorting portion of this algorithm and why? [c] What is the time complexity of the sorting algorithm chosen in step [b] as a function of the various input sizes identified in step [a]? [d] What is the overall time complexity of the chat analysis program as described above?
Please use P and V operations to solve the following problem. There are two processes P0 and P1. P0 and P1 share a variable balance. Suppose that we enforce the order of the following events: P0 does some computation, and then updates the value of balance; P1 reads the value of balance, and does some computation. That is, P1 can only read the value of balance after P0 updates the value of balance.
A dentist office is currently using paper files to manage all office activities. To make their work easier, the office decided to build a software system to manage those activities instead of using their old paper-way methods. The office patients can take their appointments either by phone or by walking in person to the office lobby. In either way, the receptionist schedules an appointment for the patient with the desired date and time. The system shall not allow scheduling appointments with the same doctor for a duration of less than 30 minutes. Of course, the system shall accept appointments for a specific doctor if the doctor is working on that time. This means that the system shall keep track of each doctor working schedule. The office receptionist enters doctors working schedule in the form of working days for each week. For example, a doctor work schedule can be on Monday, Wednesday, and Thursday from 9:00 am until 4:00 pm for all weeks until June 01, 2021. Now, the office…
3. Suppose you are given a data file called "f" and a queue called "Q". Each record in "f" has "A" or "D" character. Write an algorithm that reads all the records in the file one by one. If record keeps "A" adds this record to "Q". If record keeps "D" delete an element from the "Q". File " and "Q" has the same type. Queue capacity is 20 records.
b) Create the following path expressions. There can be only 4 instances of B at any given time, concurrently to this the processes A and C work maximally one instance in mutual exclusion. 4:(B), 1: (A; C) The process C has to be executed before th concurrent processes A and B. C:(A, B) Process A can be executed, after the process B or C have been finished. B and C can be active with two incarnations. 2: (B, C); A
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)
Student information is being held in a data area, where each student record has the following format: The first nine bytes are the student number, held in ASCII The next byte is the course mark The next word is the section identifier There are well over three hundred such student records that have been loaded sequentially into memory starting at address $10000. The last record loaded is a dummy record with a section identifier of $FFFF, to show the end of the records. If a2 has the address of a student record, what is the location of the next record in the array / data area: