The following algorithm is proposed to solve the critical section problem between twoprocesses P and P2, where lock is a shared variable.P1P2do {while (lock) { NULL;}lock = TRUE;critical section;lock=FALSE;reminder section;} while(TRUE);do {while(lock) { NULL;}lock = TRUE;critical section;lock=FALSE;reminder section;} while(TRUE);Which of the following statements is true regarding the proposed algorithm?...Lütfen birini seçin:O a. Mutual exclusion to the critical section is guaranteed.O b. None of the above.O c. Both processes can be in their critical section at the same time.O d. Lock should be initialized to TRUE.

The following algorithm is proposed to solve the critical section problem between two processes P1 and P2, where lock is a shared variable. P1 do { while (lock) { NULL;} lock = TRUE; critical section; lock=FALSE; P2 do { while(lock) { NULL;} lock = TRUE; critical section; lock=FALSE; reminder section; reminder section; } while(TRUE); } while(TRUE); Which of the following statements is true regarding the proposed algorithm? Lütfen birini seçin: O a. Mutual exclusion to the critical section is guaranteed. O b. None of the above. Ос. Both processes can be in their critical section at the same time. O d. Lock should be initialized to TRUE.

The following algorithm is proposed to solve the critical section problem between two processes P1 and P2, where lock is a shared variable. P1 do { while (lock) { NULL;} lock = TRUE; critical section; lock=FALSE; P2 do { while(lock) { NULL;} lock = TRUE; critical section; lock=FALSE; reminder section; reminder section; } while(TRUE); } while(TRUE); Which of the following statements is true regarding the proposed algorithm? Lütfen birini seçin: O a. Mutual exclusion to the critical section is guaranteed. O b. None of the above. Ос. Both processes can be in their critical section at the same time. O d. Lock should be initialized to TRUE.

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

Using the banker's algorithm, determine whether or not each of the following states is unsafe. If the state is safe, illustrate the order in which the processes may complete . a) if Available = (0, 3, 0, 1) for ABCD respectively b) If Available=(1,0,0,2) for ABCD respectively c) If P1 requests for (1,1,0,0), can the request be granted immediately in the scenario given above d) If P4 requests for (0,0,2,0), can the request be granted immediately? *
Solutions to a dynamic programming problem have (at minimum) three things: – A recurrence relation – A brief description of what your recurrence function represents and what each case represents. – A brief description of the memory element/storage and how it’s filled in. – Always give complete solutions, not just examples.– Always declare all your variables, in English. In particular, always describe the specific - problem your algorithm is supposed to solve. – Never use weak induction.
(i) Describe Banker’s algorithm for deadlock avoidance with supporting example Consider a computer system with has four identical units of a resource R. There are three processes each with a maximum claim of two units of resource R. Processes can request these resources in anyway, that is, two in one shot or one by one. The system always satisfies a request a request for a resource if enough resources are available. If the process doesn’t request any other kind of resource, show that the system never deadlock Give a solution for the following synchronization problem using semaphores Producer- Consumer Problem Readers- Writers Problem List out the issues in preprocessor scheduling that causes performance degradation in multiprocessor systems
( VanderPol's condition is given by the accompanying condition where w and c are constants. d?y dy dt2 w (1 — у?) + су%3D0 dt dy (0) dt y(0) = 2 = 0 %3D Tackle the condition structure time 0 to 10 (augmentations of 0.01) for upsides of c and w going from 1 to 3 in additions of 0.5 (25 cases aggregate) and plot and name the stage plane (for example y(t) on x hub versus dy(t)/dt on yaxis) for each case on a similar plot..
b) Simulate a dynamic programming algorithm for a rod with prices of < 2 4 8 12 13 >. Organize your work in a table with appropriately labeled columns. Identify the cuts. Pseudo code for cutRod() appears after number 4. please show in table.
The Dining Philosopher solution using monitors shown in the code snippet below does not suffer from deadlock. However, starvation is still possible. Explain in details why. Each philosopher i invokes the operations pickup() and putdown() in the following sequence: DiningPhilosophers.pickup(i); EAT DiningPhilosophers.putdown(i);
Computer Science Prove or disprove the following is a solution to the critical section problem: boolean lock= FALSE /* Process i */ do{ waiting[i]= TRUE; key = TRUE; while(waiting[i] && key){ key = compare_and_swap(&lock, FALSE, TRUE); }/* uninterruptable function */ waiting[i] = FALSE; /* Critical Section */ If (waiting[j] == TRUE) waiting[j] = FALSE; else lock = FALSE; /* Remainder Section */ }while (TRUE);
The issue is said to have the given property if it is feasible to develop an optimum solution for the problem by first successfully creating optimal solutions for each of the problem's subproblems. a) Subproblems that overlap one another; b) achieving optimum substructure; c) memory; and d) being greedy
Which of the following is true regarding the requirements for the solutions to critical-section problem?A) mutual exclusion implies progressB) progress implies bounded waitingC) bounded waiting implies progressD) all of the choices are incorrect
A deadlock is the very unpleasant situation that may occur in very dynamic world of running processes, a situation that must be avoided at all costs. One famous algorithm for deadlock avoidance is the Banker's algorithm for deadlock avoidance. The version of this algorithm presented in this module's commentary gives just one solution (the Greedy approach). Consider the Greedy approach to the Banker's algorithm. Give an example of application of this algorithm for 7 processes (named P1, ... , P7) and 5 resource types (named R1, ... , R5). Start by listing the matrices involved in this algorithm, that constitute its input data; also, do not forget to mention the overall resources of each type available in this fictional system. Proceed by describing the algorithm, step by step; for each step, mention the test performed, which process was chosen, what is the old and new status of the Work array, etc. In the end, list the solution, that is the safe sequence of processes resulting from this…
Figure 4 shows a program that tries to solve the dining philosophers' problem given that itonly includes 3 philosophers who want to eat, where only 3 forks are available and eachphilosopher needs two forks. The outputs after running the program are given .In the outputs, it seems that the program never finishes executing; thus, (a) which lines of the code are considered critical section? (b) which lines of the code is (or should be) implemented as atomic operations
Explore the bakery algorithm for the N-process critical problem. Explain all the conditions for good solution to a critical section problem against the bakery algorithm. Your explanation needs to have a proper scenario you can discuss the scenarios either diagrammatically or descriptively.