Deadlock QUIZ Operating Systems

1. What situation describes a deadlock in a computer system?

• Multiple processes completing tasks simultaneously
• Processes that are indefinitely blocked, waiting for each other’s resources
• Processes that prioritize system resources efficiently
• Processes that automatically release resources when idle

2. In the traffic analogy, when does a deadlock occur?

• When one car moves forward while others wait
• When all cars are in motion simultaneously
• When each car waits indefinitely for others to move first
• When cars alternate moving one at a time in sequence

3. What is the main reason for preventing deadlocks in system design?

• To enhance system efficiency by blocking processes
• To prevent processes from waiting indefinitely on each other
• To create continuous processing without resource sharing
• To enable simultaneous access to all resources by all processes

4. Which of the following best describes a mutex lock?

• A tool that frees resources instantly
• A lock that allows all processes to access the resource at once
• A lock that restricts access to only one process at a time
• A mechanism that prevents resources from being shared forever

5. Which of the following is NOT a required condition for deadlock to occur?

• Mutual Exclusion
• Hold and Wait
• Shared Execution
• Circular Wait

6. What is meant by the "mutual exclusion" condition?

• Allowing multiple processes to access a resource simultaneously
• Having exclusive access to a resource so no other process can use it
• Resources can be taken away from a process anytime
• All processes share resources freely

7. Which statement best describes the "hold and wait" condition?

• Processes release resources while waiting for others
• A process holds onto one resource and waits for another
• Processes do not wait for each other at all
• Resources are held temporarily and then released immediately

8. What does "no preemption" mean in terms of deadlock?

• Resources can be forcibly taken from a process holding them
• Resources cannot be forcibly taken from a process
• Processes can share resources without delay
• Processes receive pre-assigned resources for exclusive use

9. How does the "circular wait" condition contribute to deadlock?

• Processes release resources in a circular order
• Processes wait for a resource held by the next in a chain
• Each process has independent access to resources
• Only one process is given all resources

10. In which of the following systems is deadlock a potential issue?

• Database systems
• Operating systems
• Distributed systems
• All of the above