Department Of Computer Science & engineering  And IT
Class : CSE V & IT
Subject: Principals Of Operating Systems

Tutorial Sheet –8

Q1. Is it possible to have a deadlock involving only one process? Explain your answer.

Q2. Suppose that a system is in unsafe state. Show that it is possible for the processes to complete their execution without entering the deadlock

Q3. Consider a system consisting of four resources of same type that are shared by three processes, each needs at most two resources. Show that the system is deadlock free.

Q4. Can a system detects that some of its processes is starving? If you answer "yes" explain how it Can. you answer "no" explain bow the system can deal with starvation problem.

Q5. Consider the traffic deadlock.
(a) Show that the four necessary conditions for deadlock indeed hold in this example?
(b) State a-simple rule that will avoid deadlocks in the system.

Q6. How can recover deadlock?

Q7. Explain Banker's algorithm. (B.E., May-2001)