Consider a system consisting of $k$ instances of a resource $R$, being shared by 5 processes. Assume that each process requires a maximum of two instances of resource $R$ and a process can request or release only one instance at a time. Further, a process can request the second instance of the resource only after acquiring the first instance. The minimum value of K for the system to be deadlock-free is $\_\_\_\_$ . (answer in integer)
Consider the following threads, T1, T2 and T3 executing on a single processor, synchronized using three binary semaphore variables, S1, S2 and S3, operated upon using standard wait( ) and signal( ). The threads can be context switched in any order and at any time.
| $${T_1}$$ | $${T_2}$$ | $${T_3}$$ |
|---|---|---|
| while (true) { wait ($${S_3}$$); print ("C"); signal ($${S_2}$$); } |
while (true) { wait ($${S_1}$$); print ("B"); signal ($${S_3}$$); } |
while (true) { wait ($${S_2}$$); print ("A") signal ($${S_1}$$); } |
Which initialization of the semaphores would print the sequence BCABCABCA....... ?
Which of the following statements is/are TRUE with respect to deadlocks?
GATE CSE Subjects
Browse all chapters by subject