1. What is Deadlock ? Junior A. a state where each process in a set waits forever for a resource held by another in the set B. a state in which some ordering of processes lets each finish without causing deadlock C. a directed graph of processes and resources whose cycles can indicate a deadlock D. a non-preemptive prevention scheme where an older process waits but a younger requester is killed
2. Which term means: "a state where each process in a set waits forever for a resource held by another in the set"? Junior A. Wait-die scheme B. Hold and wait condition C. Deadlock avoidance D. Deadlock
3. Which statement is correct? Junior A. Deadlock — the Coffman condition that a process holds resources while waiting to acquire additional ones B. Deadlock — a state where each process in a set waits forever for a resource held by another in the set C. Deadlock — a state where processes keep changing state in response to each other but make no real progress D. Deadlock — a directed graph of processes and resources whose cycles can indicate a deadlock
4. What is Mutual exclusion condition ? Junior A. the Coffman condition that at least one resource must be held in a non-shareable mode B. resolving an existing deadlock by aborting processes or preempting their resources C. a non-preemptive prevention scheme where an older process waits but a younger requester is killed D. a preemptive prevention scheme where an older process preempts a younger one holding a resource
5. Which term means: "the Coffman condition that at least one resource must be held in a non-shareable mode"? Junior A. No preemption condition B. Livelock C. Deadlock D. Mutual exclusion condition
6. Which statement is correct? Junior A. Mutual exclusion condition — using advance knowledge of resource needs to keep the system in a safe state at all times B. Mutual exclusion condition — the Coffman condition that at least one resource must be held in a non-shareable mode C. Mutual exclusion condition — a state where processes keep changing state in response to each other but make no real progress D. Mutual exclusion condition — a state in which some ordering of processes lets each finish without causing deadlock
7. What is Hold and wait condition ? Junior A. the Coffman condition that a resource can be released only voluntarily by the process holding it B. a state in which some ordering of processes lets each finish without causing deadlock C. a non-preemptive prevention scheme where an older process waits but a younger requester is killed D. the Coffman condition that a process holds resources while waiting to acquire additional ones
8. Which term means: "the Coffman condition that a process holds resources while waiting to acquire additional ones"? Junior A. Deadlock prevention B. Deadlock detection C. Deadlock D. Hold and wait condition
9. Which statement is correct? Junior A. Hold and wait condition — the Coffman condition that a closed chain of processes each waits for a resource the next one holds B. Hold and wait condition — resolving an existing deadlock by aborting processes or preempting their resources C. Hold and wait condition — using advance knowledge of resource needs to keep the system in a safe state at all times D. Hold and wait condition — the Coffman condition that a process holds resources while waiting to acquire additional ones
10. What is No preemption condition ? Junior A. a preemptive prevention scheme where an older process preempts a younger one holding a resource B. a state where each process in a set waits forever for a resource held by another in the set C. the Coffman condition that a resource can be released only voluntarily by the process holding it D. resolving an existing deadlock by aborting processes or preempting their resources
11. Which term means: "the Coffman condition that a resource can be released only voluntarily by the process holding it"? Junior A. Mutual exclusion condition B. Deadlock prevention C. Safe state D. No preemption condition
12. Which statement is correct? Junior A. No preemption condition — a directed graph of processes and resources whose cycles can indicate a deadlock B. No preemption condition — a preemptive prevention scheme where an older process preempts a younger one holding a resource C. No preemption condition — the Coffman condition that a closed chain of processes each waits for a resource the next one holds D. No preemption condition — the Coffman condition that a resource can be released only voluntarily by the process holding it
13. What is Circular wait condition ? Junior A. a state where processes keep changing state in response to each other but make no real progress B. the Coffman condition that a resource can be released only voluntarily by the process holding it C. the Coffman condition that a closed chain of processes each waits for a resource the next one holds D. letting deadlocks occur, then finding them with an algorithm and recovering afterward
14. Which term means: "the Coffman condition that a closed chain of processes each waits for a resource the next one holds"? Junior A. Deadlock B. Deadlock avoidance C. Circular wait condition D. Safe state
15. Which statement is correct? Junior A. Circular wait condition — the Coffman condition that a closed chain of processes each waits for a resource the next one holds B. Circular wait condition — a state where each process in a set waits forever for a resource held by another in the set C. Circular wait condition — resolving an existing deadlock by aborting processes or preempting their resources D. Circular wait condition — the Coffman condition that a resource can be released only voluntarily by the process holding it
16. What is Resource allocation graph ? Mid A. the Coffman condition that a process holds resources while waiting to acquire additional ones B. letting deadlocks occur, then finding them with an algorithm and recovering afterward C. a state where processes keep changing state in response to each other but make no real progress D. a directed graph of processes and resources whose cycles can indicate a deadlock
17. Which term means: "a directed graph of processes and resources whose cycles can indicate a deadlock"? Mid A. Deadlock B. Banker's algorithm C. Resource allocation graph D. Deadlock recovery
18. Which statement is correct? Mid A. Resource allocation graph — a preemptive prevention scheme where an older process preempts a younger one holding a resource B. Resource allocation graph — using advance knowledge of resource needs to keep the system in a safe state at all times C. Resource allocation graph — a directed graph of processes and resources whose cycles can indicate a deadlock D. Resource allocation graph — the Coffman condition that a resource can be released only voluntarily by the process holding it
19. What is Deadlock prevention ? Mid A. ensuring deadlock cannot occur by structurally negating one of the four necessary conditions B. a state where each process in a set waits forever for a resource held by another in the set C. a directed graph of processes and resources whose cycles can indicate a deadlock D. the Coffman condition that a process holds resources while waiting to acquire additional ones
20. Which term means: "ensuring deadlock cannot occur by structurally negating one of the four necessary conditions"? Mid A. Wound-wait scheme B. Deadlock prevention C. Deadlock recovery D. No preemption condition
21. Which statement is correct? Mid A. Deadlock prevention — the Coffman condition that a closed chain of processes each waits for a resource the next one holds B. Deadlock prevention — the Coffman condition that a process holds resources while waiting to acquire additional ones C. Deadlock prevention — the Coffman condition that at least one resource must be held in a non-shareable mode D. Deadlock prevention — ensuring deadlock cannot occur by structurally negating one of the four necessary conditions
22. What is Deadlock avoidance ? Mid A. an avoidance algorithm that grants a request only if the resulting state is still safe B. using advance knowledge of resource needs to keep the system in a safe state at all times C. letting deadlocks occur, then finding them with an algorithm and recovering afterward D. a preemptive prevention scheme where an older process preempts a younger one holding a resource
23. Which term means: "using advance knowledge of resource needs to keep the system in a safe state at all times"? Mid A. Deadlock prevention B. Deadlock detection C. Deadlock D. Deadlock avoidance
24. Which statement is correct? Mid A. Deadlock avoidance — the Coffman condition that a closed chain of processes each waits for a resource the next one holds B. Deadlock avoidance — using advance knowledge of resource needs to keep the system in a safe state at all times C. Deadlock avoidance — a state in which some ordering of processes lets each finish without causing deadlock D. Deadlock avoidance — a non-preemptive prevention scheme where an older process waits but a younger requester is killed
25. What is Deadlock detection ? Mid A. a preemptive prevention scheme where an older process preempts a younger one holding a resource B. a state where each process in a set waits forever for a resource held by another in the set C. letting deadlocks occur, then finding them with an algorithm and recovering afterward D. the Coffman condition that a process holds resources while waiting to acquire additional ones
26. Which term means: "letting deadlocks occur, then finding them with an algorithm and recovering afterward"? Mid A. Banker's algorithm B. Deadlock detection C. Circular wait condition D. No preemption condition
27. Which statement is correct? Mid A. Deadlock detection — a directed graph of processes and resources whose cycles can indicate a deadlock B. Deadlock detection — the Coffman condition that a process holds resources while waiting to acquire additional ones C. Deadlock detection — a state where processes keep changing state in response to each other but make no real progress D. Deadlock detection — letting deadlocks occur, then finding them with an algorithm and recovering afterward
28. What is Banker's algorithm ? Senior A. a directed graph of processes and resources whose cycles can indicate a deadlock B. a non-preemptive prevention scheme where an older process waits but a younger requester is killed C. an avoidance algorithm that grants a request only if the resulting state is still safe D. the Coffman condition that a resource can be released only voluntarily by the process holding it
29. Which term means: "an avoidance algorithm that grants a request only if the resulting state is still safe"? Senior A. Resource allocation graph B. Livelock C. Deadlock recovery D. Banker's algorithm
30. Which statement is correct? Senior A. Banker's algorithm — a directed graph of processes and resources whose cycles can indicate a deadlock B. Banker's algorithm — a state in which some ordering of processes lets each finish without causing deadlock C. Banker's algorithm — a state where processes keep changing state in response to each other but make no real progress D. Banker's algorithm — an avoidance algorithm that grants a request only if the resulting state is still safe Showing 30 of 45 OS · Deadlock questions — the full set, with answers, explanations and an AI tutor on every question, is inside.