Question 1

All unsafe states are___________
A)deadlocks
B)not deadlocks
C)fatal
D)none of the mentioned

Accepted Answer

Unsafe states are not necessarily deadlocks, but they indicate a condition where the possibility of a deadlock exists if further precautions are not taken. An unsafe state leads to a situation where there is a potential for processes to get stuck waiting for resources, but it does not guarantee a deadlock.

Question 2

If no cycle exists in the resource allocation graph___________
A)then the system will not be in a safe state
B)then the system will be in a safe state
C)all of the mentioned
D)none of the mentioned

Accepted Answer

If no cycle exists in the resource allocation graph, it indicates that there are no circular dependencies among processes for resources, which means the system can allocate resources in such a way that it can avoid deadlocks, thus being in a safe state.

Question 3

The resource allocation graph is not applicable to a resource allocation system
A)with multiple instances of each resource type
B)with a single instance of each resource type
C)single & multiple instances of each resource type
D)none of the mentioned

Accepted Answer

The resource allocation graph is specifically designed for systems with a single instance of each resource type. When there are multiple instances of a resource type, the graph cannot accurately represent the allocation state and potential deadlock situations, making it not applicable.

Question 4

The data structures available in the Banker's algorithm are___________
A)available
B)need
C)allocation
D)all of the mentioned

Accepted Answer

The Banker's algorithm uses all of the mentioned data structures: available, need, and allocation, to manage resources and avoid deadlocks.

Question 5

The content of the matrix Need is
A)allocation - available
B)max - available
C)max - allocation
D)allocation - max

Accepted Answer

The content of the matrix Need is calculated as max - allocation, which represents the maximum demand of each resource by each process minus the amount currently allocated to each process.

Question 6

The wait-for graph is a deadlock detection algorithm that is applicable when
A)all resources have a single instance
B)all resources have multiple instances
C)all resources have a single 7 multiple instances
D)all of the mentioned

Accepted Answer

The wait-for graph is specifically designed for scenarios where all resources have a single instance. In such graphs, nodes represent processes, and an edge from one process to another indicates that the first process is waiting for a resource held by the second process. This method is not directly applicable for resources with multiple instances, as the graph does not capture the complexity of multiple instances being held and requested.

Question 7

An edge from process Pi to Pj in a wait for graph indicates that___________
A)pi is waiting for pj to release a resource that pi needs
B)pj is waiting for pi to release a resource that pj needs
C)pi is waiting for pj to leave the system
D)pj is waiting for pi to leave the system

Accepted Answer

An edge from process Pi to Pj in a wait-for graph indicates that Pi is waiting for Pj to release a resource that Pi needs. This is used to represent resource allocation and waiting conditions in a system.

Question 8

If the wait for graph contains a cycle
A)then a deadlock does not exist
B)then a deadlock exists
C)then the system is in a safe state
D)either deadlock exists or system is in a safe state

Accepted Answer

A wait for graph is used to represent the allocation of resources and process requests in a system. If the wait for graph contains a cycle, it means that there is a set of processes each of which is waiting for a resource held by another process in the set. This situation indicates a deadlock because none of the processes can proceed until one of them releases a resource, which will not happen since each process is waiting for another resource to be released first.

Question 9

If deadlocks occur frequently, the detection algorithm must be invoked___________  
A)rarely
B)frequently
C)rarely & frequently
D)none of the mentioned

Accepted Answer

If deadlocks occur frequently, the detection algorithm must be invoked frequently to identify and resolve them in a timely manner.

Question 10

What is the disadvantage of invoking the detection algorithm for every request?
A)overhead of the detection algorithm due to consumption of memory
B)excessive time consumed in the request to be allocated memory
C)considerable overhead in computation time
D)all of the mentioned

Accepted Answer

The answer of What is the disadvantage of invoking the...

Question 11

A deadlock eventually cripples system throughput and will cause the CPU utilization to___________  
A)increase
B)drop
C)stay still
D)none of the mentioned

Accepted Answer

Deadlock causes the system to halt progress on certain tasks, leading to underutilization of the CPU as it cannot proceed with the tasks at hand, causing CPU utilization to drop.

Question 12

Every time a request for allocation cannot be granted immediately, the detection algorithm is invoked. This will help identify
A)the set of processes that have been deadlocked
B)the set of processes in the deadlock queue
C)the specific process that caused the deadlock
D)all of the mentioned

Accepted Answer

The detection algorithm is designed to identify the set of processes that have been deadlocked, not necessarily the specific process that caused it or a so-called "deadlock queue."

Question 13

A computer system has 6 tape drives, with 'n' processes competing for them. Each process may need 3 tape drives. The maximum value of 'n' for which the system is guaranteed to be deadlock free is?
A)2
B)3
C)4
D)1

Accepted Answer

To ensure the system is deadlock-free, each process must be able to obtain up to 3 tape drives. If there are 2 processes, each can potentially obtain 3 drives, using all 6 drives without causing a deadlock. However, with more than 2 processes, it's possible for each process to hold 2 drives without any being able to obtain a third, leading to a deadlock. Therefore, the maximum number of processes (n) for a deadlock-free system is 2.

Question 14

A system has 3 processes sharing 4 resources. If each process needs a maximum of 2 units then, deadlock___________
A)can never occur
B)may occur
C)has to occur
D)none of the mentioned

Accepted Answer

The system has 4 resources and each process needs a maximum of 2 units. So, the total number of units needed by all the processes is 2 * 3 = 6 units. Since the system has 4 resources, there is no way that all the processes can get the resources they need at the same time. Therefore, deadlock can never occur.

Question 15

'm' processes share 'n' resources of the same type. The maximum need of each process doesn't exceed 'n' and the sum of all their maximum needs is always less than m+n. In this setup, deadlock___________
A)can never occur
B)may occur
C)has to occur
D)none of the mentioned

Accepted Answer

Given the conditions, there's always at least one resource available for a process, preventing a deadlock situation.

Question 16

A deadlock can be broken by
A)abort one or more processes to break the circular wait
B)abort all the process in the system
C)preempt all resources from all processes
D)none of the mentioned

Accepted Answer

Abort one or more processes to break the circular wait is a common strategy for handling deadlocks. By aborting a process, the system can break the cycle of processes waiting on each other, thus resolving the deadlock situation.

Question 17

The two ways of aborting processes and eliminating deadlocks are___________
A)abort all deadlocked processes
B)abort all processes
C)abort one process at a time until the deadlock cycle is eliminated
D)all of the mentioned

Accepted Answer

The answer of The two ways of aborting processes and...

Question 18

Those processes should be aborted on occurrence of a deadlock, the termination of which?
A)is more time consuming
B)incurs minimum cost
C)safety is not hampered
D)all of the mentioned

Accepted Answer

The process that incurs the minimum cost should be aborted to resolve a deadlock, minimizing the impact on the system.

Question 19

The process to be aborted is chosen on the basis of the following factors?
A)priority of the process
B)process is interactive or batch
C)how long the process has computed
D)all of the mentioned

Accepted Answer

The process to be aborted can be chosen based on various factors including its priority, whether it is interactive or batch, and how long it has been computing. These criteria help in making a decision that aims to minimize the impact of the abortion on the system's performance and user experience.

Question 20

Cost factors for process termination include___________
A)number of resources the deadlock process is not holding
B)cpu utilization at the time of deadlock
C)amount of time a deadlocked process has thus far consumed during its execution
D)all of the mentioned

Accepted Answer

The amount of time a deadlocked process has consumed is a relevant cost factor for deciding whether to terminate it, as it reflects the investment already made in the process.

Quiz 14: Deadlock and Resource Allocation in Computer Systems

All unsafe states are___________

If no cycle exists in the resource allocation graph___________

The resource allocation graph is not applicable to a resource allocation system

The data structures available in the Banker's algorithm are___________

The content of the matrix Need is

The wait-for graph is a deadlock detection algorithm that is applicable when

An edge from process Pi to Pj in a wait for graph indicates that___________

If the wait for graph contains a cycle

If deadlocks occur frequently, the detection algorithm must be invoked___________

What is the disadvantage of invoking the detection algorithm for every request?

A deadlock eventually cripples system throughput and will cause the CPU utilization to___________

Every time a request for allocation cannot be granted immediately, the detection algorithm is invoked. This will help identify

A computer system has 6 tape drives, with 'n' processes competing for them. Each process may need 3 tape drives. The maximum value of 'n' for which the system is guaranteed to be deadlock free is?

A system has 3 processes sharing 4 resources. If each process needs a maximum of 2 units then, deadlock___________

'm' processes share 'n' resources of the same type. The maximum need of each process doesn't exceed 'n' and the sum of all their maximum needs is always less than m+n. In this setup, deadlock___________

A deadlock can be broken by

The two ways of aborting processes and eliminating deadlocks are___________

Those processes should be aborted on occurrence of a deadlock, the termination of which?

The process to be aborted is chosen on the basis of the following factors?

Cost factors for process termination include___________