Construct an example where Raymond’s algorithm does not exhibit FCFS behavior for entry to a CS. (Hint: Consider the following situation in Example 18.2: Process P2 makes a request for CS entry while P5 is still in CS.)
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.