Operating system mcqs deadlock detection

YOU CAN DOWNLOAD 200+ SUBJECTS PDF BOOK FOR COMPETITIVE EXAMINATIONS

CLICK HERE TO DOWNLOAD

Operating system mcqs deadlock detection

Question 1 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
If deadlocks occur frequently, the detection algorithm must be invoked .....
A
rarely
B
frequently
C
rarely & frequently
D
none of the mentioned
Question 2 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
Every time a request for allocation cannot be granted immediately, the detection algorithm is invoked. This will help identify .....
A
the set of processes that have been deadlocked
B
the set of processes in the deadlock queue
C
the specific process that caused the deadlock
D
all of the mentioned
Question 3 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
The wait-for graph is a deadlock detection algorithm that is applicable when .....
A
all resources have a single instance
B
all resources have multiple instances
C
all resources have a single 7 multiple instances
D
all of the mentioned
Question 4 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
What is the disadvantage of invoking the detection algorithm for every request?
A
overhead of the detection algorithm due to consumption of memory
B
excessive time consumed in the request to be allocated memory
C
considerable overhead in computation time
D
all of the mentioned
Question 5 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
'm' processes share 'n' resources of the same type. The maximum need of each process doesn't exceed 'n' and the sum of all their maximum needs is always less than m+n. In this setup, deadlock .....
A
can never occur
B
may occur
C
has to occur
D
none of the mentioned
There are 5 questions to complete.