1According to the course materials, why is the Banker's Algorithm considered unrealistic for use in most modern Operating Systems?
2In the context of deadlock prevention, which condition is generally impossible to disallow because some resources are inherently non-shareable?
3A system has 12 processes. 6 processes require 1 resource each, 3 processes require 2 resources each, and the remaining 3 processes require 6 resources each. What is the minimum number of resources (x) required to guarantee the system is deadlock-free?
4True or False: A cyclic dependency in a Resource Allocation Graph always indicates that a deadlock has occurred.
5Regarding thread implementation, which of the following statements is true about stacks?
6If a system uses the Many-to-Many multithreading model, what is the minimum number of kernel threads needed to provide better concurrency than the Many-to-One model?
7In a system with 'n' processes where each process requires 3 copies of resource 'R', what is the formula for the maximum number of resources that can be allotted while the system is still potentially in a deadlock?
8When a thread library performs a context switch between user-level threads, which of the following actions are typically involved?
9A safe state in resource allocation is defined as a state where:
10Which of the following are valid strategies for dealing with the 'Hold and Wait' condition in deadlock prevention?
