Unit - 4 Important Questions
- What is a deadlock? Consider the deadlock situation that could occur in the dining philosopher’s problem when the philosophers obtain the chopsticks one at a time. Discuss how the four necessary conditions for deadlock indeed hold in this setting. What are the solutions for this problem?
- Explain Deadlock Detection scheme for Several Instances of a resource Type.
- What is Producer Consumer problem? How it can illustrate the classical problem of synchronization? Explain.
- What is monitor? Explain its functionalities. How it is different from semaphore in implementing synchronization.
- What is a semaphore? List the types of semaphores and Show that, if the wait() and signal() semaphore operations are not executed atomically, then mutual exclusion may be violated.
- How to implement process synchronization using i)Test and Set ii) SWAP iii) Lock instructions? Explain with Pseudo code.
- Explain deadlock avoidance using banker’s algorithm with suitable example.
- How to Recover From Deadlock situations? Discuss in detail. (OR) Explain recovery from deadlock after detection.
- Explain deadlock avoidance process using Resource-Allocation-Graph.
- What is Peterson’s Solution? Discuss the Critical Section problem using Peterson’s Solution.
- Discuss deadlock avoidance using Resource-Allocation-Graph Algorithm.
- Explain Deadlock detection algorithm with an example.
- Explain the Resource-Allocation Graph Algorithm for deadlock prevention.
- Discuss the necessary conditions that cause deadlock situation to occur.
- Is it possible to have a deadlock involving only a single process? Explain.
- How does deadlock avoidance differ from deadlock prevention? Write about deadlock avoidance algorithm in detail.
- Discuss the necessary conditions that cause deadlock situation to occur.
- Discuss various methods for the prevention of deadlocks.
