Computer Sciences > Gate 2020 > semaphores
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.

CODE SECTION P
wait(a); count=count+1;
if (count==n) signal (b);
signal (a): wait (b) ; signal (b);
CODE SECTION Q

What does the code achieve ?
A
It ensures that no process executes CODE SECTION Q before every process has finished CODE SECTION P.
B
It ensures that two processes are in CODE SECTION Q at any time.
C
It ensures that all processes execute CODE SECTION P mutually exclusively.
D
It ensures that at most nโˆ’1 processes are in CODE SECTION P at any time.

Explanation

Correct : a

Similar Questions

What is the worst-case time complexity of insertion in an AVL tree?
Question #23 Medium
Which operations on a binary search tree have O(h) complexity?
Question #31 Easy
Compare search complexities of sorted array vs balanced BST.
Question #47 Hard

Related Topics

Data Structures Binary Search Tree Time Complexity Algorithm Analysis Tree Algorithms Computer Science