A certain computation generates two arrays a and b such that a[i] = f (i) for 0 i andlt; n andb[i] = g (a [i]) for 0 i andlt; 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; iandlt;n; i++) {a[i] = f(i);ExitX(R, S);}Process Y:private i;for (i=0; iandlt;n; i++) {EntryY(R, S);b[i] = g(a[i]);}Which one of the following represents the CORRECT implementations of ExitX and EntryY?a)ExitX(R, S) {P(R);V(S);}EntryY(R, S) {P(S);V(R);}b)ExitX(R, S) {V(R);V(S);}EntryY(R, S) {P(R);P(S);}c)ExitX(R, S) {P(S);V(R);}EntryY(R, S) {V(S);P(R);}d)ExitX(R, S) {V(R);P(S);}EntryY(R, S) {V(S);P(R);}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 > A certain computation generates two arrays a ...

Join the Discussion on the App

A certain computation generates two arrays a and b such that a[i] = f (i) for 0

i < n and
b[i] = g (a [i]) for 0

i < n . Suppose this computation is decomposed into two concurrent
processes X and Y such that X computes the array a and Y computes the array b. The
processes employ two binary semaphores R and S, both initialized to zero. The array a is
shared 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?

a)
ExitX(R, S) {
P(R);
V(S);
}
EntryY(R, S) {
P(S);
V(R);
}
b)
ExitX(R, S) {
V(R);
V(S);
}
EntryY(R, S) {
P(R);
P(S);
}
c)
ExitX(R, S) {
P(S);
V(R);
}
EntryY(R, S) {
V(S);
P(R);
}
d)
ExitX(R, S) {
V(R);
P(S);
}
EntryY(R, S) {
V(S);
P(R);
}

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

FREE This question is part of

Computer Science And Information Technology - CS 2013 GATE Paper (Practice Test)

Attempt Test

Attempt this Test

Verified Answer

A certain computation generates two arrays a and b such that a[i] = f ...

For computing both the array a[] and b[], first element a[i] should be computed using which b[i] can be computed. So process X and Y should run in strict alteration manner, starting with X. This requirement meets with implementation of ExitX and EntryY given in option C.

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

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

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?

View answer

Fetch_And_Add(X,i) is an atomic Read-Modify-Write instruction that reads the value ofmemory location X, increments it by the value i, and returns the old value of X. It is used in thepseudocode shown below to implement a busy-wait lock. L is an unsigned integer shared variableinitialized to 0. The value of 0 corresponds to lock being available, while any non-zero valuecorresponds to the lock being not available.AcquireLock(L){while (Fetch_And_Add(L,1))L = 1;}ReleaseLock(L){L = 0;}This implementation

View answer

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

What is the return value of f(p,p) if the value of p is initialized to 5 before the call? Notethat the first parameter is passed by reference, whereas the second parameter is passed byvalue.int f (int &x, int c) {c= c- 1;if (c= 0) return 1;x = x+ 1;return f (x,c )* x;}

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?a)ExitX(R, S) {P(R);V(S);}EntryY(R, S) {P(S);V(R);}b)ExitX(R, S) {V(R);V(S);}EntryY(R, S) {P(R);P(S);}c)ExitX(R, S) {P(S);V(R);}EntryY(R, S) {V(S);P(R);}d)ExitX(R, S) {V(R);P(S);}EntryY(R, S) {V(S);P(R);}Correct answer is option 'C'. Can you explain this answer?

Share with a Friend

Answer this doubt

Question Description
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?a)ExitX(R, S) {P(R);V(S);}EntryY(R, S) {P(S);V(R);}b)ExitX(R, S) {V(R);V(S);}EntryY(R, S) {P(R);P(S);}c)ExitX(R, S) {P(S);V(R);}EntryY(R, S) {V(S);P(R);}d)ExitX(R, S) {V(R);P(S);}EntryY(R, S) {V(S);P(R);}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 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?a)ExitX(R, S) {P(R);V(S);}EntryY(R, S) {P(S);V(R);}b)ExitX(R, S) {V(R);V(S);}EntryY(R, S) {P(R);P(S);}c)ExitX(R, S) {P(S);V(R);}EntryY(R, S) {V(S);P(R);}d)ExitX(R, S) {V(R);P(S);}EntryY(R, S) {V(S);P(R);}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 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?a)ExitX(R, S) {P(R);V(S);}EntryY(R, S) {P(S);V(R);}b)ExitX(R, S) {V(R);V(S);}EntryY(R, S) {P(R);P(S);}c)ExitX(R, S) {P(S);V(R);}EntryY(R, S) {V(S);P(R);}d)ExitX(R, S) {V(R);P(S);}EntryY(R, S) {V(S);P(R);}Correct answer is option 'C'. Can you explain this answer?.

Solutions for 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?a)ExitX(R, S) {P(R);V(S);}EntryY(R, S) {P(S);V(R);}b)ExitX(R, S) {V(R);V(S);}EntryY(R, S) {P(R);P(S);}c)ExitX(R, S) {P(S);V(R);}EntryY(R, S) {V(S);P(R);}d)ExitX(R, S) {V(R);P(S);}EntryY(R, S) {V(S);P(R);}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 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?a)ExitX(R, S) {P(R);V(S);}EntryY(R, S) {P(S);V(R);}b)ExitX(R, S) {V(R);V(S);}EntryY(R, S) {P(R);P(S);}c)ExitX(R, S) {P(S);V(R);}EntryY(R, S) {V(S);P(R);}d)ExitX(R, S) {V(R);P(S);}EntryY(R, S) {V(S);P(R);}Correct answer is option 'C'. Can you explain this answer? defined & explained in the simplest way possible. Besides giving the explanation of 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?a)ExitX(R, S) {P(R);V(S);}EntryY(R, S) {P(S);V(R);}b)ExitX(R, S) {V(R);V(S);}EntryY(R, S) {P(R);P(S);}c)ExitX(R, S) {P(S);V(R);}EntryY(R, S) {V(S);P(R);}d)ExitX(R, S) {V(R);P(S);}EntryY(R, S) {V(S);P(R);}Correct answer is option 'C'. Can you explain this answer?, a detailed solution for 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?a)ExitX(R, S) {P(R);V(S);}EntryY(R, S) {P(S);V(R);}b)ExitX(R, S) {V(R);V(S);}EntryY(R, S) {P(R);P(S);}c)ExitX(R, S) {P(S);V(R);}EntryY(R, S) {V(S);P(R);}d)ExitX(R, S) {V(R);P(S);}EntryY(R, S) {V(S);P(R);}Correct answer is option 'C'. Can you explain this answer? has been provided alongside types of 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?a)ExitX(R, S) {P(R);V(S);}EntryY(R, S) {P(S);V(R);}b)ExitX(R, S) {V(R);V(S);}EntryY(R, S) {P(R);P(S);}c)ExitX(R, S) {P(S);V(R);}EntryY(R, S) {V(S);P(R);}d)ExitX(R, S) {V(R);P(S);}EntryY(R, S) {V(S);P(R);}Correct answer is option 'C'. Can you explain this answer? theory, EduRev gives you an ample number of questions to practice 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?a)ExitX(R, S) {P(R);V(S);}EntryY(R, S) {P(S);V(R);}b)ExitX(R, S) {V(R);V(S);}EntryY(R, S) {P(R);P(S);}c)ExitX(R, S) {P(S);V(R);}EntryY(R, S) {V(S);P(R);}d)ExitX(R, S) {V(R);P(S);}EntryY(R, S) {V(S);P(R);}Correct answer is option 'C'. Can you explain this answer? tests, examples and also practice GATE tests.

Explore Courses for GATE exam