Syllabus: Chapter 1, Chapter 2 and Chapter 3 half
Q. Define Starvation?
Q. Explain the term 'select a victim and rollback' in the context of deadlock recovery.
Q. Wait for a graph is used for deadlock avoidance in the system. True/False
Q.What is deadlock? State different methods to handle a deadlock.
Q. Explain deadlock prevention strategies.
Q. What is a wait-for-graph?
Q. What is rollback?
Q. How the system is prevented from deadlock?
Q. Define request edge and claim edge.
Q. State necessary conditions for deadlock to occur.
Q. Explain ways for deadlock recovery.
Numericals:
Q. What is content of need matrix, is the system in safe state? if yes, give the safe sequence.
Q. Is the system deadlocked, if so, which processes are involved.