Anna University
Department of Computer Science Engineering
Department of Computer Science Engineering
Subject Code : CS2411
Subject Name : Operating Systems
Department : B.E EEE
Year : Final Yr
Semester : VII
Unit 3 Important Questions :
Part A
1. Define dead lock & state the necessary conditions for deadlock?
2. What are the strategies available in Deadlock concept?
3. Define service time?
4. Define lock.
5. Define safe state?
6. explain deadlock issures?
7. what are the way is for deadlock recovery?
8. what does the term “resources ordering” mean in deadlock?
9. define dispatch latency?
10. how can we handle deadlock?
Part – B
1. Explain about the methods used to prevent deadlock?
2. Explain the Banker’s algorithm for deadlock avoidance.
3. Explain Monitors with neat diagram and algorithm for the dining philosopher problem.
4. Give a detailed description about deadlocks and its characterization.
5. write in detail about deadlock avoidance.
6. what are the methods involved in recovery from deadlock?
Share your Study Materials with us : 
