Unit - 4 Important Questions

1. 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?
2. Explain Deadlock Detection scheme for Several Instances of a resource Type.
3. What is Producer Consumer problem? How it can illustrate the classical problem of synchronization? Explain. 
4. What is monitor? Explain its functionalities. How it is different from semaphore in implementing synchronization. 
5. 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. 
6. How to implement process synchronization using i)Test and Set ii) SWAP iii)  Lock instructions? Explain with Pseudo code.
7. Explain deadlock avoidance using banker’s algorithm with suitable example.
8. How to Recover From Deadlock situations? Discuss in detail. (OR) Explain recovery from deadlock after detection.
9. Explain deadlock avoidance process using Resource-Allocation-Graph. 
10. What is Peterson’s Solution? Discuss the Critical Section problem using Peterson’s Solution.
11. Discuss deadlock avoidance using Resource-Allocation-Graph Algorithm.
12. Explain Deadlock detection algorithm with an example.
13. Explain the Resource-Allocation Graph Algorithm for deadlock prevention.
14. Discuss the necessary conditions that cause deadlock situation to occur.
15. Is it possible to have a deadlock involving only a single process? Explain. 
16. How does deadlock avoidance differ from deadlock prevention? Write about deadlock avoidance algorithm in detail.
17. Discuss the necessary conditions that cause deadlock situation to occur.
18. Discuss various methods for the prevention of deadlocks.