Operating Systems and Deadlock Conditions Quiz

Which of the following is a condition for deadlocks?

• Mutual Exclusion

• Resource Sharing

• Preemptive Allocation

• Unlimited Resources

What is the purpose of resource ordering in deadlock prevention?

• To increase resource availability

• To assign a unique order to all resources

• To allow preemption of resources

• To decrease process priority

Which condition allows a process to hold one resource while waiting for others?

• No Preemption

• Hold and Wait

• Circular Wait

• Mutual Exclusion

What is a drawback of requiring processes to request all required resources at once?

• It leads to efficient resource utilization.

• It can cause increased waiting times.

• It ensures all resources are preemptable.

• It simplifies the resource allocation process.

What is a potential issue with preemption in resource allocation?

• All resources are preemptable.

• It always leads to consistent states.

• It can lead to inconsistent states if not managed carefully.

• It eliminates the need for a safety check.

What is the primary purpose of the Banker's Algorithm?

• To increase resource allocation speed.

• To avoid deadlocks by simulating resource allocation.

• To ensure all resources are used simultaneously.

• To minimize the number of processes in a system.

Which data structure in the Banker's Algorithm represents the current resources allocated to each process?

• Maximum Demand Matrix

• Allocation Matrix

• Available Vector

• Resource Allocation Table

What is a limitation of the Banker's Algorithm?

• It is easy to implement in all systems.

• It is computationally expensive for large systems.

• It guarantees deadlock prevention without any checks.

• It requires no data structures for implementation.

What is a key point of the Shortest Seek Time First (SSTF) disk scheduling algorithm?

• It ensures uniform wait times.

• It can cause starvation for requests far away from the head.

• It is optimal but impossible to implement in practice.

• It jumps back to the start without servicing requests on the return pass.

How does the SCAN (Elevator Algorithm) disk scheduling algorithm operate?

• It always chooses the next request closest to the current head position.

• It moves in one direction until it reaches the end, then reverses direction.

• It jumps back to the start without servicing requests on the return pass.

• It evicts the page that will not be used for the longest time in the future.