System Administrator 2026 — Test 11

The wait operation of the semaphore basically works on the basic _______ system call.

The signal operation of the semaphore basically works on the basic _______ system call.

If the semaphore value is negative ____________

The code that changes the value of the semaphore is ____________

The following program consists of 3 concurrent processes and 3 binary semaphores. The semaphores are initialized as S0 = 1, S1 = 0, S2 = 0. Process P0 while(true) { wait(S0); print '0'; release(S1); release(S2); } Process P1 wait(S1); release(S0); Process P2 wait(S2); release(S0); How many times will P0 print ‘0’?

Each process Pi, i = 0,1,2,3,……,9 is coded as follows. repeat P(mutex) {Critical Section} V(mutex) forever The code for P10 is identical except that it uses V(mutex) instead of P(mutex). What is the largest number of processes that can be inside the critical section at any moment (the mutex being initialized to 1)?

Two processes, P1 and P2, need to access a critical section of code. Consider the following synchronization construct used by the processes. Process P1 : while(true) { w1 = true; while(w2 == true); Critical section w1 = false; } Remainder Section Process P2 : while(true) { w2 = true; while(w1 == true); Critical section w2 = false; } Remainder Section Here, w1 and w2 have shared variables, which are initialized to false. Which one of the following statements is TRUE about the above construct?

What is the other name for distance vector routing algorithm?

How tables are updated in the distance vector routing algorithm?

Which of the following is not a similarity between flooding and distance vector routing?