Q#1: Deadlock is a situation where:
(A) Two or more processes wait indefinitely for resources held by each other
(B) CPU is idle
(C) Memory is full
(D) Disk is busy
Answer: (A) Two or more processes wait indefinitely for resources held by each other
Q#2: Necessary conditions for deadlock include:
(A) Mutual exclusion, hold and wait, no preemption, circular wait
(B) Only mutual exclusion
(C) Only CPU scheduling
(D) Only memory allocation
Answer: (A) Mutual exclusion, hold and wait, no preemption, circular wait
Q#3: Mutual exclusion means:
(A) A resource can be held by only one process at a time
(B) Multiple processes share resource simultaneously
(C) Only CPU-bound process
(D) Only memory-bound process
Answer: (A) A resource can be held by only one process at a time
Q#4: Hold and wait means:
(A) Process holds at least one resource while waiting for others
(B) Process holds no resource while waiting
(C) CPU idle
(D) Memory full
Answer: (A) Process holds at least one resource while waiting for others
Q#5: No preemption condition implies:
(A) A resource cannot be forcibly taken from a process
(B) CPU can preempt process
(C) Only memory allocation
(D) Only disk scheduling
Answer: (A) A resource cannot be forcibly taken from a process
Q#6: Circular wait condition is:
(A) A set of processes wait for resources in a circular chain
(B) Processes run independently
(C) Only CPU scheduling
(D) Only memory allocation
Answer: (A) A set of processes wait for resources in a circular chain
Q#7: Deadlock prevention aims to:
(A) Ensure at least one necessary condition cannot hold
(B) Only improve CPU utilization
(C) Only memory management
(D) Only disk scheduling
Answer: (A) Ensure at least one necessary condition cannot hold
Q#8: Deadlock avoidance requires:
(A) Knowledge of future resource requests
(B) Only CPU scheduling
(C) Only memory allocation
(D) Only I/O scheduling
Answer: (A) Knowledge of future resource requests
Q#9: Banker’s algorithm is used for:
(A) Deadlock avoidance
(B) Deadlock detection
(C) CPU scheduling
(D) Memory allocation
Answer: (A) Deadlock avoidance
Q#10: In Banker’s algorithm, safe state means:
(A) System can allocate resources to all processes in some order and avoid deadlock
(B) System is idle
(C) Memory is full
(D) Disk busy
Answer: (A) System can allocate resources to all processes in some order and avoid deadlock
Q#11: Unsafe state means:
(A) Deadlock may occur if processes request resources
(B) CPU idle
(C) Memory full
(D) Disk busy
Answer: (A) Deadlock may occur if processes request resources
Q#12: Deadlock detection allows:
(A) System to check for circular wait and recover
(B) Only CPU scheduling
(C) Only memory allocation
(D) Only disk scheduling
Answer: (A) System to check for circular wait and recover
Q#13: Recovery from deadlock can be done by:
(A) Terminating or preempting processes
(B) Only CPU reset
(C) Only memory allocation
(D) Only disk scheduling
Answer: (A) Terminating or preempting processes
Q#14: Resource allocation graph (RAG) is used to:
(A) Detect deadlocks
(B) Schedule CPU
(C) Allocate memory
(D) Manage disks
Answer: (A) Detect deadlocks
Q#15: In RAG, a cycle indicates:
(A) Potential deadlock
(B) CPU idle
(C) Memory overflow
(D) Disk failure
Answer: (A) Potential deadlock
Q#16: Single instance per resource RAG cycle:
(A) Deadlock exists
(B) CPU idle
(C) Memory overflow
(D) Disk full
Answer: (A) Deadlock exists
Q#17: Multiple instances per resource RAG cycle:
(A) Deadlock may or may not exist
(B) Deadlock guaranteed
(C) CPU idle
(D) Memory full
Answer: (A) Deadlock may or may not exist
Q#18: Starvation occurs when:
(A) Low-priority processes never get resources
(B) High-priority processes terminate
(C) CPU idle
(D) Memory full
Answer: (A) Low-priority processes never get resources
Q#19: Starvation can be prevented using:
(A) Aging
(B) Ignore priorities
(C) CPU reset
(D) Random scheduling
Answer: (A) Aging
Q#20: Preemption can help prevent deadlocks by:
(A) Forcibly taking resources from some processes
(B) Ignoring processes
(C) Only CPU scheduling
(D) Only memory allocation
Answer: (A) Forcibly taking resources from some processes
Q#21: Deadlock detection algorithm complexity:
(A) Depends on number of processes and resources
(B) Always constant
(C) Only memory-bound
(D) Only CPU-bound
Answer: (A) Depends on number of processes and resources
Q#22: Resource ordering is a deadlock prevention method that:
(A) Assigns a linear order to resources to avoid circular wait
(B) Randomly allocates resources
(C) Only CPU scheduling
(D) Only memory allocation
Answer: (A) Assigns a linear order to resources to avoid circular wait
Q#23: Hold-and-wait prevention can be done by:
(A) Requiring processes to request all resources at once
(B) Request resources randomly
(C) Only CPU scheduling
(D) Only memory allocation
Answer: (A) Requiring processes to request all resources at once
Q#24: Mutual exclusion prevention is difficult because:
(A) Some resources are inherently non-sharable
(B) CPU idle
(C) Memory full
(D) Disk busy
Answer: (A) Some resources are inherently non-sharable
Q#25: Deadlock can affect:
(A) CPU, memory, and I/O resources
(B) Only CPU
(C) Only memory
(D) Only disk
Answer: (A) CPU, memory, and I/O resources
Q#26: Detection algorithm may use:
(A) Wait-for graph
(B) CPU registers
(C) Memory blocks
(D) Disk sectors
Answer: (A) Wait-for graph
Q#27: Recovery by process termination can be:
(A) Abort all or one process at a time until deadlock breaks
(B) Only CPU reset
(C) Only memory allocation
(D) Only disk scheduling
Answer: (A) Abort all or one process at a time until deadlock breaks
Q#28: Resource preemption recovery:
(A) Temporarily takes resources from some processes
(B) Only CPU idle
(C) Only memory allocation
(D) Only disk scheduling
Answer: (A) Temporarily takes resources from some processes
Q#29: Deadlocks are more common in:
(A) Systems with multiple resource types and high resource contention
(B) Single process systems
(C) Only CPU scheduling
(D) Only memory-bound systems
Answer: (A) Systems with multiple resource types and high resource contention
Q#30: Deadlock detection is costly in:
(A) Large systems with many resources and processes
(B) Small systems
(C) Only CPU-bound
(D) Only memory-bound
Answer: (A) Large systems with many resources and processes
Q#31: Safe state ensures:
(A) All processes can finish execution eventually
(B) CPU idle
(C) Memory full
(D) Disk busy
Answer: (A) All processes can finish execution eventually
Q#32: Unsafe state does not always mean:
(A) Deadlock will occur
(B) CPU idle
(C) Memory full
(D) Disk busy
Answer: (A) Deadlock will occur
Q#33: Deadlock detection can be:
(A) Periodic or on-demand
(B) Continuous only
(C) Never required
(D) Only CPU reset
Answer: (A) Periodic or on-demand
Q#34: Resource allocation matrix is used in:
(A) Banker’s algorithm
(B) Only CPU scheduling
(C) Only memory allocation
(D) Only disk scheduling
Answer: (A) Banker’s algorithm
Q#35: Circular wait can be avoided by:
(A) Assigning unique order numbers to resources
(B) Random allocation
(C) CPU idle
(D) Memory full
Answer: (A) Assigning unique order numbers to resources
Q#36: Hold-and-wait can be avoided by:
(A) Requiring all resources to be requested at once
(B) Random allocation
(C) CPU idle
(D) Memory full
Answer: (A) Requiring all resources to be requested at once
Q#37: Preemption in deadlocks:
(A) May involve rolling back processes
(B) Always terminate processes
(C) Only CPU scheduling
(D) Only memory allocation
Answer: (A) May involve rolling back processes
Q#38: Resource allocation graph edges:
(A) Request edge and assignment edge
(B) Only CPU edge
(C) Only memory edge
(D) Only disk edge
Answer: (A) Request edge and assignment edge
Q#39: Request edge:
(A) Process requests a resource
(B) Resource released
(C) Only CPU scheduling
(D) Only memory allocation
Answer: (A) Process requests a resource
Q#40: Assignment edge:
(A) Resource assigned to a process
(B) Process requests resource
(C) Only CPU scheduling
(D) Only memory allocation
Answer: (A) Resource assigned to a process
Q#41: Deadlock recovery may affect:
(A) System throughput and process performance
(B) Only CPU utilization
(C) Only memory allocation
(D) Only disk usage
Answer: (A) System throughput and process performance
Q#42: Detection algorithms can use:
(A) Wait-for graph
(B) Only CPU registers
(C) Only memory blocks
(D) Only disk sectors
Answer: (A) Wait-for graph
Q#43: Deadlock avoidance requires:
(A) Dynamic resource allocation strategies
(B) Random allocation
(C) CPU idle
(D) Memory full
Answer: (A) Dynamic resource allocation strategies
Q#44: Deadlock prevention is:
(A) Conservative and may reduce resource utilization
(B) Always optimal
(C) Only CPU bound
(D) Only memory bound
Answer: (A) Conservative and may reduce resource utilization
Q#45: Banker’s algorithm assumes:
(A) Maximum resource requirement of each process is known in advance
(B) Unknown resource requirement
(C) CPU idle
(D) Memory full
Answer: (A) Maximum resource requirement of each process is known in advance
Q#46: Starvation can occur in deadlock handling if:
(A) Some processes are repeatedly preempted
(B) All processes complete normally
(C) CPU idle
(D) Memory full
Answer: (A) Some processes are repeatedly preempted
Q#47: Deadlock handling policies:
(A) Prevention, avoidance, detection and recovery
(B) Only CPU scheduling
(C) Only memory allocation
(D) Only disk management
Answer: (A) Prevention, avoidance, detection and recovery
Q#48: Deadlock can cause:
(A) Reduced throughput and resource wastage
(B) Only CPU optimization
(C) Only memory optimization
(D) Only disk optimization
Answer: (A) Reduced throughput and resource wastage
Q#49: In multi-instance resource systems, deadlock detection uses:
(A) Banker’s algorithm or wait-for graph
(B) Only CPU scheduling
(C) Only memory allocation
(D) Only disk management
Answer: (A) Banker’s algorithm or wait-for graph
Q#50: Main purpose of deadlock management:
(A) Ensure safe and efficient execution of processes
(B) Only CPU utilization
(C) Only memory allocation
(D) Only disk usage
Answer: (A) Ensure safe and efficient execution of processes