MCQs of Deadlock (Operating System - 3140702)

Operating System (3140702) MCQs

MCQs of Deadlock

Showing 41 to 40 out of 50 Questions

41.

A process said to be in ___________ state if it was waiting for an event that will never occur.

(a)	Safe
(b)	Unsafe
(c)	Starvation
(d)	Deadlock

42.

In one of the deadlock prevention methods, impose a total ordering of all resource types, and require that each process requests resources in an increasing order of enumeration. This violates the _______________ condition of deadlock.

(a)	Mutual exclusion
(b)	Hold and Wait
(c)	Circular Wait
(d)	No Preemption

43.

Resource locking ________.

(a)	allows multiple tasks to simultaneously use resource
(b)	forces only one task to use any resource at any time
(c)	can easily cause a deadlock condition
(d)	is not used for disk drives

44.

Banker's algorithm for resource allocation deals with__________________

(a)	deadlock prevention
(b)	deadlock aviodance
(c)	deadlock recovery
(d)	deadlock detection

45.

Four necessary conditions for deadlock are non pre-emption, circular wait, hold and wait and _________

(a)	mutual exclusion
(b)	race condition
(c)	buffer overflow
(d)	None of above

46.

Which of following is not a condition of Deadlock ?

(a)	Mutual Exclusion
(b)	No Preemption
(c)	Hold and Wait
(d)	Race Condition

47.

Deadlocks can be described by which graph?

(a)	Resource-Allocation Graph
(b)	Complete Graph
(c)	Hamilton Graph
(d)	Super Graph

48.

A system has 'm' number of resources of same type and 3 processes A, B, C. Share these resources A, B, C which have the peak demand of 3, 4 and 6 respectively. Deadlock will not occur if the value of 'm' is __________.

(a)	15
(b)	8
(c)	13
(d)	9

49.

Which of the following is not the approach to dealing with deadlock?

(a)	Prevention
(b)	Avoidance
(c)	Detection
(d)	Deletion

50.

RAG stands for __________

(a)	resource allocation graph
(b)	resource allocation grant
(c)	re allocation graph
(d)	None of above

Showing 41 to 40 out of 50 Questions