<p>www.vustudents.ning.com </p><p>Cs604 quiz 2 06- 06-2012</p><p>By umair sid variable accessible through wait and signal which </p><p>The condition where a set of blocked processes each holding a resource and waiting to acquire a resource held by another process in the set, is termed as ______. The Deadlock Problem</p><p>A dashed line is used to represent a ______in Resource Allocation Graph. claim edge</p><p>The problem of Deadlocks can be solved by ______method(s).</p><p>� Ensure that the system will never enter a deadlock state. � Allow the system to enter a deadlock state and then recover from deadlock. � Ignore the problem and pretend that deadlocks never occur in the system. n Resource Allocation Graph, a ______Pi --->Rj indicates that process Pi may request resource Rj at some time in the future. claim edge</p><p>Wrong use of wait and signal operations (in context with semaphores) can cause ______problem(s).</p><p>Mutual Exclusion Deadlock Bounded waiting All of the given </p><p>______S is an integer variable accessible through wait and signal which are atomic operations.</p><p>Semaphore Mutex Busy waiting single </p><p>Preventing the condition of ______to happen, deadlocks can be prevented to happen. </p><p>Critical region Circulate wait Monitor Critical section </p><p>Which of the following is correct definition for wait operation? www.vustudents.ning.com </p><p>Wait(s){ wait(S) { Wait(S) { Wait(S) { While (s>=0) S--; S++; While (S<=0) ;// no op } } ;// no op</p><p>The process of holding at least one resource and waiting to acquire additional resources that are currently being held by other processes is known as ______.</p><p>Mutual exclusion hold and wait no preemption circular wait </p><p>If a system is not in a safe state, there can be NO deadlocks.</p><p>True false </p><p>The condition in which a set {P0, P1… Pn} of waiting processes must exist such that P0 is waiting for a resource that is held by P1, P1 is waiting for a resource that is held by P2, and so on, Pn-1 is waiting for a resource held by Pn, and Pn is waiting for a resource held by P0. This condition is known as ______.</p><p>Mutual exclusion hold and wait no preemption circular wait</p><p>______algorithm is used for solving n-process critical section problem.</p><p>Bankers bakery babbles non of the given </p><p>Preventing the condition of ______to happen, deadlocks can be prevented to happen. Critical region critical wait monitors critical section </p><p>The integer value of ______semaphores can not be greater than 1.</p><p>Counting binary mutex bounded buffer </p>