Question: Suppose we want to synchronize two concurrent processes P and Q using binary semaphores S and T. The code for the processes P and Q

 Suppose we want to synchronize two concurrent processes P and Q

using binary semaphores S and T. The code for the processes P

and Q is shown below: Process P: while (1) { W: print

Suppose we want to synchronize two concurrent processes P and Q using binary semaphores S and T. The code for the processes P and Q is shown below: Process P: while (1) { W: print '0'; print '0'; X: 3 Process Q: while (1) { Y: print '1'; print '1'; Z: } Which of the following will ensure that the output string never contains a sub string of the form 01"o or 10'1 where n is odd? Select one: O A P(S) at W. V(S) at X, P(S) at Y, V(S) at Z, S initially 1 O B. V(5) at W, VIT) at X, P(S) at Y, V(T) at Z, 5 and T initially 1 OC. P(S) at W, VIT) at X, P(T) at Y, V(S) at Z, S and T initially 1 OD. P(S) at W. V(S) at X, PT) at Y, VIT) at Z, S and T initially 1 A typical magnetic disk reader has the following specifications: i Rotational speed is 10000 rotations per minute (RPM) ii. transfer rate of 50 x 106 bytes/sec. iii. the average seek time of the disk is twice the average rotational delay iv. the controller's transfer time is 10 times the disk transfer time. What is the average rotational delay of the disk? Select one: O A. (0.5 x 60/10000) msec O B. (0.5 x 60/10000) x 1000 msec OC (0.3 x 50 x 106) msec OD. ((60/10000) x 1000) msec

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!