Chapter 6, Concurrency: Deadlock and Starvation

#	Question	Marks	Year
1	Give the difference between consumable and reusable resources.	1	Jan,2004
2	Explain Deadlock OR What is Deadlock? OR Write short note on Deadlock. OR Single process Deadlock.	1 1 4 2	Jan,2000 Jan,2004 Jan,2005 Jan,2006
3	Describe the necessary conditions for deadlock occurrence. OR List the four conditions that create deadlock OR List the conditions that lead to deadlock. How can we solve the deadlock problem? OR How no preemption condition far deadlock is prevented? OR Explain strategies to prevent deadlock OR Discuss the various conditions that lead to deadlock. OR Explain the conditions for deadlock. What is deadlock prevention?	1 1 4 2 3 2 3	Jan,2000 Jan,2003 Jan,2004 Aug,2004 Aug,2004 Jan,2006 Dec,2006
4	Discuss the deadlock avoidance using banker’s algorithm. Also discuss data structures for implementing this algorithm. OR Explain the method of Deadlock Avoidance in particular explains Banker’s Algorithm with suitable example. OR Explain Deadlock avoidance strategy with example.	3 5 4	Jan,2000 Jan,2006 Dec,2006
5	Explain deadlock detection and recovery with appropriate algorithm. OR List the steps that are performed in a Deadlock detection Algorithm.	2 2	Jan,2006 Jan,2008
6	Explain Starvation OR Explain Starvation with appropriate example.	1 2	Jan,2000 Jan,2005
7	Give the difference between Deadlock and Starvation.	2	Dec,2006
8	Explain the difference between deadlock avoidance , detection and prevention	2	Jan,2003
9	Consider the following snapshot of a system. There are no current outstanding queued unsatisfied and p indicates the process) Currently available R1 R2 R3 R4 2 1 0 0 Process Current Allocation Maximum Demand Still Needs P1 R1 R2 R3 R4 R1 R2 R3 R4 R1 R2 R3 R4 P2 0 0 1 2 0 0 1 2 0 0 0 0 P3 2 0 0 0 2 7 5 0 0 7 5 0 P4 0 0 3 4 6 6 5 6 6 6 2 2 P5 2 3 5 4 4 3 5 6 2 0 0 2 a)      Compute what each process still might request and display in the columns labeled “still needs”.       b)      Applying banker’s algorithm whether this system currently in a safe or unsafe state? Why?                 c)      What is the possible order in which processes can finish without any deadlock?	8	Jan,2002
10	Apply the dead lock detection algorithm to the following data and show the result Available = (2 1 0 0) Request = | 2 0 0 1 |                  | 1 0 1 0 |                  | 2 1 0 0 | Allocation = | 0 0 1 0 |                          | 2 0 0 1 |                      | 0 1 2 0 |	5	Aug,2004
11	Consider the following snapshot of a system. There are no current outstanding queued unsatisfied requests. Currently Available R1 R2 R3 R4 3 2 0 0 Process Current Allocation Maximum Demand Still Needs P1 R1 R2 R3 R4 R1 R2 R3 R4 R1 R2 R3 R4 P2 0 0 1 1 0 0 1 2 P3 2 0 0 0 2 7 5 0 P4 2 3 5 3 4 3 5 6 P5 0 3 3 2 0 6 5 2 a)      Compute what each process still might request and display in the columns labeled “Still needs” b)      Applying Banker’s algorithm check whether this system is currently in a safe or unsafe state? Why? c)      Is this system currently deadlocked? Why or why not d)     What is the possible order in which processes can finish without any deadlock? Which processes, if any or many become deadlocked? If a request from p3 arrives for (0, 1, 0, 0) can that request be safely granted immediately granting that whole request leave the system? Which process if any, are or may become deadlocked if this whole request is granted immediately?	6	Jan,2006
12	State whether the following statements are true or false. Starvation always results in deadlock.	1	Jan,2002