One way to ensure that the circular wait condition never holds is to ____________(a) impose a total ordering of all resource types and to determine whether one precedes another in the ordering(b) to never let a process acquire resources that are held by other processes(c) to let a process wait for only one resource at a time(d) all of the mentionedI have been asked this question in examination.Asked question is from Deadlock Prevention in division Deadlocks of Operating System

One way to ensure that the circular wait condition never holds is to _

1.	One way to ensure that the circular wait condition never holds is to ____________(a) impose a total ordering of all resource types and to determine whether one precedes another in the ordering(b) to never let a process acquire resources that are held by other processes(c) to let a process wait for only one resource at a time(d) all of the mentionedI have been asked this question in examination.Asked question is from Deadlock Prevention in division Deadlocks of Operating System
Answer» The CORRECT choice is (a) IMPOSE a total ordering of all resource types and to determine WHETHER one precedes another in the ordering Explanation: NONE.

Discussion

No Comment Found

Related InterviewSolutions

If the resources are always preempted from the same process __________ can occur.(a) deadlock(b) system crash(c) aging(d) starvationThe question was posed to me in an online interview.Query is from Deadlock Recovery in chapter Deadlocks of Operating System
What is the solution to starvation?(a) the number of rollbacks must be included in the cost factor(b) the number of resources must be included in resource preemption(c) resource preemption be done instead(d) all of the mentionedI got this question in a job interview.Question is taken from Deadlock Recovery in portion Deadlocks of Operating System
If we preempt a resource from a process, the process cannot continue with its normal execution and it must be ____________(a) aborted(b) rolled back(c) terminated(d) queuedThis question was posed to me in an online interview.The doubt is from Deadlock Recovery in chapter Deadlocks of Operating System
To _______ to a safe state, the system needs to keep more information about the states of processes.(a) abort the process(b) roll back the process(c) queue the process(d) none of the mentionedThe question was posed to me in examination.This question is from Deadlock Recovery topic in chapter Deadlocks of Operating System
Cost factors for process termination include ____________(a) Number of resources the deadlock process is not holding(b) CPU utilization at the time of deadlock(c) Amount of time a deadlocked process has thus far consumed during its execution(d) All of the mentionedThe question was asked in exam.The question is from Deadlock Recovery in portion Deadlocks of Operating System
Those processes should be aborted on occurrence of a deadlock, the termination of which?(a) is more time consuming(b) incurs minimum cost(c) safety is not hampered(d) all of the mentionedThis question was addressed to me in an interview.My query is from Deadlock Recovery topic in section Deadlocks of Operating System
The process to be aborted is chosen on the basis of the following factors?(a) priority of the process(b) process is interactive or batch(c) how long the process has computed(d) all of the mentionedI had been asked this question by my college director while I was bunking the class.Question is from Deadlock Recovery topic in division Deadlocks of Operating System
The two ways of aborting processes and eliminating deadlocks are ____________(a) Abort all deadlocked processes(b) Abort all processes(c) Abort one process at a time until the deadlock cycle is eliminated(d) All of the mentionedI have been asked this question in an internship interview.Asked question is from Deadlock Recovery in portion Deadlocks of Operating System
‘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 mentionedThis question was posed to me in semester exam.My question is from Deadlock Detection in portion Deadlocks of Operating System
A deadlock can be broken by ____________(a) abort one or more processes to break the circular wait(b) abort all the process in the system(c) preempt all resources from all processes(d) none of the mentionedI got this question in unit test.This intriguing question comes from Deadlock Recovery in portion Deadlocks of Operating System

Discussion

No Comment Found

Related InterviewSolutions

Reply to Comment