2 ) Consider two processes PO and P1 which shares a global variable 'flag'. The value of flag is either 0 or 1 where 0 indicates "PO is permitted to enter into critical section" and 1 indicates for P1. Assume PO and P1 are concurrent processes which are executing the following code with initial value of flag as 0. while(1) { While(flag!=i); flag=1-i; } If PO starts executing first, which of the following holds by the above execution? A) Mutual Exclusion B) B) Progress C) C) Bounded waiting D) D) Both (A) and (C) Justify your answer.

2 ) Consider two processes PO and P1 which shares a global variable 'flag'. The value of flag is either 0 or 1 where 0 indicates "PO is permitted to enter into critical section" and 1 indicates for P1. Assume PO and P1 are concurrent processes which are executing the following code with initial value of flag as 0. while(1) { While(flag!=i); flag=1-i; } If PO starts executing first, which of the following holds by the above execution? A) Mutual Exclusion B) B) Progress C) C) Bounded waiting D) D) Both (A) and (C) Justify your answer.

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

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.
Assume a binary semaphore variable, S is initialized to 1. The semaphore operations flow which is wait (S) – critical section – signal (S) has been changed. The new flow is omits the wait (S), or the signal (S), or both. What will happened in this situation? Select one: a.several processes maybe executing in their critical section b.either mutual exclusion is violated or a deadlock will occur. c.processes will starve to enter critical section
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.
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
Given that there are FIVE (5) processes (A, B, C, D and E) and FOUR (4) resources (R1, R2,R3 and R4) involved in a project. Assume that all the resources are non-sharable and the number of instances for each resource is 2, 3, 2, 3 respectively. *Process A holds one instance of R1, R2 and R4. It requests one instance of R3.* Process B holds one instance of R1 and R3. It requests one instance of R4.* Process C holds one instance of R2 and R4.* Process D holds one instance of R2 and R4. It requests one instance of R1.* Process E holds one instance of R3. It requests one instance of R2. (i) Draw a directed resources allocation graph for the above scenario and Are these five processes in a deadlock state? Justify your answer.
Code a C++ program, named processes.cpp that receives one argument, (i.e., argv[1]) upon itsinvocation and searches how many processes whose name is given in argv[1] are running onthe system where your program has been invoked. To be specific, your program shoulddemonstrate the same behavior as:$ ps -A | grep argv[1] | wc -lImplement processes using the following system calls:1. pid_t fork( void ); creates a child process that differs from the parent process only interms of their process IDs.2. int execlp( const char *file, const char *arg, ..., (char *)0 ); replaces the currentprocess image with a new process image that will be loaded from file. The firstargument arg must be the same as file. The last argument is a NULL pointer of type“char *”.3. int pipe( int filedes[2] ); creates a pair of file descriptors (which point to a pipestructure), and places them in the array pointed to by filedes. filedes[0] is for readingdata from the pipe, filedes[1] is for writing data to the pipe.4.…
Write a c program called file1.c Program file1.c uses these: (a) fork() to launch another process. (b) exec() to replace the program driving this process, while supplying arguments to file2.c to complete its execution. (c) wait() to complete the execution of the child process. (d) file1.c takes two arguments x( a number less than 1) and n (number of terms to be added, 1 or more). For example: file1 0.5 5 (e) When the child process finishes, the parent prints: Parent(PID=yyy) : Done
Interrupts are system wide events that stops the execution of a currently running process. Examples of interrupts include (but are not limited to) mouse clicks, process termination, key presses, etc. Some interrupts are considered as more important to be handled first then the others. For example, a hardware interrupt such as hard drive read operation has lesser priority than a memory read. In this way, the most appropriate data structure for representing of such events is the priority queue. Demonstrate by writing an algorithm or a flowchart how to insert the following interrupts in a heap so the highest priority element should move out first. Interrupts Priorities INT 0 100 INT 10 51 INT 11 52 INT 21 54
"Semaphore' is a synchronization tool used to solve the critical section problem. Various types of errors can be generated when semaphores are used incorrectly. Suppose that 2 concurrent processes, P, and P,, are cooperating using the wait() and the signal() operations over the 'sem' semaphore. Below, on the left side, there is the pseudo-code of a correct process Pj. Which type of danger generates the incorrect process P; when running in parallel with P;? Make a simulation to justify your answer (no point without a valid simulation). Pseudo-code P; | Pseudo-code P; wait (sem); critical section; wait(sem); critical section; wait(sem) signal(sem);
Interrupts are system wide events that stop the execution of a currently running process. Examples of interrupts include (but are not limited to) mouse clicks, process termination, key presses, etc. Some interrupts are considered as more important to be handled first then the others. For example, a hardware interrupt such as hard drive read operation has lesser priority than a memory read. In this way, the most appropriate data structure for representing of such events is the priority queue. Demonstrate by writing an algorithm or a flowchart how to insert the following interrupts in a heap so the highest priority element should move out first. Interrupts Priorities INT 0 100 INT 10 51 INT 11 52 INT 21 54
Write a system program in C that defines a default action (handler) for SIGINT. The process will kill its parent process with SIGKILL when the signal SIGINT is received. The process is also required to block SIGUSR1 and SIGUSR2 during the handling of SIGINT. need full c code for this
in C++ please create a Priority : -pre-emptive algorithm code: here are information that will help you Tasks: • Lab 4: Process management • Review Process management algorithms Definitions: (in terms for this lab not formal definitions) • Preemptive: When a new process arrives and has a higher priority than the current running process, Then the current running process is paused and put back in the waiting queue, and the new process starts executing. In most systems it will automatically interrupt the current running job when the new job arrives, however some systems use a predetermined interval (a certain number of time units), to check for new jobs. • Non preemptive: Take no action when a process with higher priority arrives,when a new process with a higher precedence arrives current running process need to finish first before the new process goes Oxford definition: Preempt – to take action in order to prevent (an anticipated event) from happening; forestall. • Metric: a metric is…