Mutual exclusion can be provided by the __________a.Mutex locksb.Both mutex locks and binary semaphoresc.None of the mentionedd.Binary semaphores

shared lock is requested using the ___________ instruction.a)lock-sharedb)lock-Xc)lock-Sd)lock-Pe)exclusive(x)

Which of the following condition is required for a deadlock to be possible?a.Mutual exclusionb.All of the mentionedc.No resource can be forcibly removed from a process holding itd.A process may hold allocated resources while awaiting assignment of other resources

A mutex is a simple data structure. It works with code, not data. If a mutex is locked, the other threads will continue. It's only when a thread attempts to ...

Three concurrent processes X, Y, and Z execute three different code segments that access and update certain shared variables. Process X executes the P operation (i.e., wait) on semaphores a, b and c; process Y executes the P operation on semaphores b, c and d; process Z executes the P operation on semaphores c, d, and a before entering the respective code segments. After completing the execution of its code segment, each process invokes the V operation (i.e., signal) on its three semaphores. All semaphores are binary semaphores initialized to one. Which one of the following represents a deadlock-free order of invoking the P operations by the processes?

Simulate a deadlock situation containing two threads so that due to the deadlock no thread is able to complete its execution. Each one of them is asking for a lock for two shared data items (first_mutex and second_mutex).Sample Test CasesTest Case 1:Expected Output:Thread·1·acquired·mutex1Thread·1·acquired·mutex2Thread·1·released·mutex2Thread·1·released·mutex1Thread·2·acquired·mutex2Thread·2·acquired·mutex1Thread·2·released·mutex1Thread·2·released·mutex2