383

1. Repeat the previous exercise in Ada.

2. Given two processes p and q, and a semaphore S initialized to 1, suppose p and q make the

following calls:

Describe what will happen for all possible orders of these operations on S.