OS Module-3 Quiz

What is the critical section problem in process synchronization?

• The critical section problem is a synchronization issue that occurs when multiple processes access shared resources, requiring mutual exclusion to prevent conflicts.

• The critical section problem is related to memory allocation in programming.

• The critical section problem is a method for optimizing CPU usage.

• The critical section problem only occurs in single-threaded applications.

Explain Peterson’s solution for mutual exclusion.

• Peterson's solution uses two flags and a turn variable to ensure mutual exclusion between two processes.

• Peterson's solution employs semaphores to ensure mutual exclusion.

• Peterson's solution relies on a queue to handle process requests for access.

• Peterson's solution uses a single lock to manage access between multiple processes.

What role does synchronization hardware play in process synchronization?

• Synchronization hardware facilitates process synchronization by providing tools to manage access to shared resources and prevent conflicts.

• Synchronization hardware eliminates the need for process management.

• Synchronization hardware is used to increase the speed of processes.

• Synchronization hardware is only relevant in single-threaded applications.

Define semaphores and their purpose in synchronization.

• Semaphores are synchronization tools that manage access to shared resources in concurrent programming.

• Semaphores are programming languages designed for parallel computing.

• Semaphores are used to increase the speed of a program.

• Semaphores are a type of hardware used for memory management.

What are the classical problems of synchronization?

• Thread Pool Management

• Deadlock Detection

• Producer-Consumer, Dining Philosophers, Readers-Writers, Sleeping Barber

• Banker's Algorithm

Describe the system model used for deadlock characterization.

• A flowchart of resource allocation

• The system model used for deadlock characterization is a resource allocation graph.

• A priority scheduling model

• A state transition diagram

List and explain the methods for handling deadlocks.

• Methods for handling deadlocks include prevention, avoidance, detection, and recovery.

• Ignoring the issue altogether

• Implementing a single-threaded model

• Using a fixed priority scheduling algorithm

What are the strategies for deadlock prevention?

• Resource Allocation

• Priority Scheduling

• Process Termination

• 1) Mutual Exclusion, 2) Hold and Wait, 3) No Preemption, 4) Circular Wait

How does deadlock avoidance differ from deadlock prevention?

• Deadlock avoidance and prevention are the same concepts with different names.

• Deadlock prevention allows for resource allocation but does not prevent deadlocks.

• Deadlock avoidance prevents resource allocation entirely, while deadlock prevention allows it under certain conditions.

• Deadlock avoidance allows for resource allocation while preventing deadlocks, whereas deadlock prevention ensures that deadlock conditions are never met.

What steps are involved in deadlock detection and recovery?

• Increase the priority of all processes.

• Allocate resources equally among all processes.

• Steps in deadlock detection: 1. Monitor resource allocation. 2. Construct a resource allocation graph. 3. Detect cycles in the graph. Recovery methods: 1. Terminate processes. 2. Preempt resources.

• Monitor CPU usage.