Each of a set of n processes executes the following code using two semaphores a and b initialized to 1 and 0, respectively. Assume that count is a shared variable initialized to 0 and not used in CODE SECTION P.What does the code achieve?a)It ensures that at most two processes are in CODE SECTION Q at any time.b)It ensures that all processes execute CODE SECTION P mutually exclusively.c)It ensures that no process executes CODE SECTION Q before every process has finished CODE SECTION P.d)It ensures that at most n andndash; 1 processes are in CODE SECTION P at any time.Correct answer is option 'C'. Can you explain this answer?

EduRev

All Courses

Explore Courses UPSC Exam UPSC Test Series Free Notes EduRev Infinity

Open App

GATE Exam > GATE Questions > Each of a set of n processes executes the fol...

Join the Discussion on the App

What does the code achieve?

a)
It ensures that at most two processes are in CODE SECTION Q at any time.
b)
It ensures that all processes execute CODE SECTION P mutually exclusively.
c)
It ensures that no process executes CODE SECTION Q before every process has finished CODE SECTION P.
d)
It ensures that at most n – 1 processes are in CODE SECTION P at any time.

Correct answer is option 'C'. Can you explain this answer?

FREE This question is part of

Test : CSE Past Year Paper 2020

Attempt Test

Attempt this Test

Verified Answer

Each of a set of n processes executes the following code using two sem...

All the processes running the given code will remain block due to wait(b) until the value of count becomes n.
When the value of count will become equals to n, value of b changes to 1 which will subsequently allow a process to go into section Q.
Hence, no process can go to section Q until all the process executes code section P.

View all questions of this test

View all answers Start learning for free

< Previous Question Next Question >

Explore Courses for GATE exam

Similar GATE Doubts

Consider the following synchronization construct used by two process P0 and P1 which need to access a critical section:P0 :while (tru e) {turn_0 = true;while (turn_l = = true)turn_0 = false;CRITICAL SECTION}/ * Remainder section/P1 :while (true) {turn_1 = true;while (turn_0 = = true)turn_1 = false;CRITICAL SECTION}/Remainder section*/Here, turn_0 and turn_1 are shared variables, which are initialized to false. Which of the following statements is true about the above construct?

View answer

Three concurrent processes X, Y, and Z execute three different code segments that access andupdate certain shared variables. Process X executes the P operation (i.e., wait) on semaphoresa, b and c; process Y executes the P operation on semaphores b, c and d; process Z executesthe P operation on semaphores c, d, and a before entering the respective code segments. Aftercompleting the execution of its code segment, each process invokes the V operation (i.e.,signal) on its three semaphores. All semaphores are binary semaphores initialized to one.Which one of the following represents a deadlock-free order of invoking the P operations bythe processes?

View answer

A shared variable x, initialized to zero, is operated on by four concurrent processes W, X, Y, Z asfollows. Each of the processes W and X reads x from memory, increments by one, stores it tomemory, and then terminates. Each of the processes Y and Z reads x from memory, decrements bytwo, stores it to memory, and then terminates. Each process before reading x invokes the Poperation (i.e., wait) on a counting semaphore S and invokes the V operation (i.e., signal) on thesemaphore S after storing x to memory. Semaphore S is initialized to two. What is the maximumpossible value of x after all processes complete execution?

View answer

A semaphore S is an integer variable that, apart from initialization, is accessed only through two standard atomic operations: wait () and signal (). Thus which of the following in regards to semaphore is false.

View answer

A certain computation generates two arrays a and b such that a[i] = f (i) for 0 i < n andb[i] = g (a [i]) for 0 i < n . Suppose this computation is decomposed into two concurrentprocesses X and Y such that X computes the array a and Y computes the array b. Theprocesses employ two binary semaphores R and S, both initialized to zero. The array a isshared by the two processes. The structures of the processes are shown below.Process X:private i;for (i=0; i<n; i++) {a[i] = f(i);ExitX(R, S);}Process Y:private i;for (i=0; i<n; i++) {EntryY(R, S);b[i] = g(a[i]);}Which one of the following represents the CORRECT implementations of ExitX and EntryY?

View answer

Each of a set of n processes executes the following code using two semaphores a and b initialized to 1 and 0, respectively. Assume that count is a shared variable initialized to 0 and not used in CODE SECTION P.What does the code achieve?a)It ensures that at most two processes are in CODE SECTION Q at any time.b)It ensures that all processes execute CODE SECTION P mutually exclusively.c)It ensures that no process executes CODE SECTION Q before every process has finished CODE SECTION P.d)It ensures that at most n – 1 processes are in CODE SECTION P at any time.Correct answer is option 'C'. Can you explain this answer?

Share with a Friend

Answer this doubt

Question Description
Each of a set of n processes executes the following code using two semaphores a and b initialized to 1 and 0, respectively. Assume that count is a shared variable initialized to 0 and not used in CODE SECTION P.What does the code achieve?a)It ensures that at most two processes are in CODE SECTION Q at any time.b)It ensures that all processes execute CODE SECTION P mutually exclusively.c)It ensures that no process executes CODE SECTION Q before every process has finished CODE SECTION P.d)It ensures that at most n – 1 processes are in CODE SECTION P at any time.Correct answer is option 'C'. Can you explain this answer? for GATE 2024 is part of GATE preparation. The Question and answers have been prepared according to the GATE exam syllabus. Information about Each of a set of n processes executes the following code using two semaphores a and b initialized to 1 and 0, respectively. Assume that count is a shared variable initialized to 0 and not used in CODE SECTION P.What does the code achieve?a)It ensures that at most two processes are in CODE SECTION Q at any time.b)It ensures that all processes execute CODE SECTION P mutually exclusively.c)It ensures that no process executes CODE SECTION Q before every process has finished CODE SECTION P.d)It ensures that at most n – 1 processes are in CODE SECTION P at any time.Correct answer is option 'C'. Can you explain this answer? covers all topics & solutions for GATE 2024 Exam. Find important definitions, questions, meanings, examples, exercises and tests below for Each of a set of n processes executes the following code using two semaphores a and b initialized to 1 and 0, respectively. Assume that count is a shared variable initialized to 0 and not used in CODE SECTION P.What does the code achieve?a)It ensures that at most two processes are in CODE SECTION Q at any time.b)It ensures that all processes execute CODE SECTION P mutually exclusively.c)It ensures that no process executes CODE SECTION Q before every process has finished CODE SECTION P.d)It ensures that at most n – 1 processes are in CODE SECTION P at any time.Correct answer is option 'C'. Can you explain this answer?.

Solutions for Each of a set of n processes executes the following code using two semaphores a and b initialized to 1 and 0, respectively. Assume that count is a shared variable initialized to 0 and not used in CODE SECTION P.What does the code achieve?a)It ensures that at most two processes are in CODE SECTION Q at any time.b)It ensures that all processes execute CODE SECTION P mutually exclusively.c)It ensures that no process executes CODE SECTION Q before every process has finished CODE SECTION P.d)It ensures that at most n – 1 processes are in CODE SECTION P at any time.Correct answer is option 'C'. Can you explain this answer? in English & in Hindi are available as part of our courses for GATE. Download more important topics, notes, lectures and mock test series for GATE Exam by signing up for free.

Here you can find the meaning of Each of a set of n processes executes the following code using two semaphores a and b initialized to 1 and 0, respectively. Assume that count is a shared variable initialized to 0 and not used in CODE SECTION P.What does the code achieve?a)It ensures that at most two processes are in CODE SECTION Q at any time.b)It ensures that all processes execute CODE SECTION P mutually exclusively.c)It ensures that no process executes CODE SECTION Q before every process has finished CODE SECTION P.d)It ensures that at most n – 1 processes are in CODE SECTION P at any time.Correct answer is option 'C'. Can you explain this answer? defined & explained in the simplest way possible. Besides giving the explanation of Each of a set of n processes executes the following code using two semaphores a and b initialized to 1 and 0, respectively. Assume that count is a shared variable initialized to 0 and not used in CODE SECTION P.What does the code achieve?a)It ensures that at most two processes are in CODE SECTION Q at any time.b)It ensures that all processes execute CODE SECTION P mutually exclusively.c)It ensures that no process executes CODE SECTION Q before every process has finished CODE SECTION P.d)It ensures that at most n – 1 processes are in CODE SECTION P at any time.Correct answer is option 'C'. Can you explain this answer?, a detailed solution for Each of a set of n processes executes the following code using two semaphores a and b initialized to 1 and 0, respectively. Assume that count is a shared variable initialized to 0 and not used in CODE SECTION P.What does the code achieve?a)It ensures that at most two processes are in CODE SECTION Q at any time.b)It ensures that all processes execute CODE SECTION P mutually exclusively.c)It ensures that no process executes CODE SECTION Q before every process has finished CODE SECTION P.d)It ensures that at most n – 1 processes are in CODE SECTION P at any time.Correct answer is option 'C'. Can you explain this answer? has been provided alongside types of Each of a set of n processes executes the following code using two semaphores a and b initialized to 1 and 0, respectively. Assume that count is a shared variable initialized to 0 and not used in CODE SECTION P.What does the code achieve?a)It ensures that at most two processes are in CODE SECTION Q at any time.b)It ensures that all processes execute CODE SECTION P mutually exclusively.c)It ensures that no process executes CODE SECTION Q before every process has finished CODE SECTION P.d)It ensures that at most n – 1 processes are in CODE SECTION P at any time.Correct answer is option 'C'. Can you explain this answer? theory, EduRev gives you an ample number of questions to practice Each of a set of n processes executes the following code using two semaphores a and b initialized to 1 and 0, respectively. Assume that count is a shared variable initialized to 0 and not used in CODE SECTION P.What does the code achieve?a)It ensures that at most two processes are in CODE SECTION Q at any time.b)It ensures that all processes execute CODE SECTION P mutually exclusively.c)It ensures that no process executes CODE SECTION Q before every process has finished CODE SECTION P.d)It ensures that at most n – 1 processes are in CODE SECTION P at any time.Correct answer is option 'C'. Can you explain this answer? tests, examples and also practice GATE tests.

Explore Courses for GATE exam