Deck 14: Deadlock and Resource Allocation in Computer Systems

Question 1

All unsafe states are___________

A)deadlocks
B)not deadlocks
C)fatal
D)none of the mentioned

Answer 1

not deadlocks

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

Answer 2

then the system will be 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

Answer 3

with multiple instances of each resource type

Question 4

The data structures available in the Banker's algorithm are___________

A)available
B)need
C)allocation
D)all of the mentioned

Question 5

The content of the matrix Need is

A)allocation - available
B)max - available
C)max - allocation
D)allocation - max

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

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

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

Question 9

If deadlocks occur frequently, the detection algorithm must be invoked___________  

A)rarely
B)frequently
C)rarely & frequently
D)none of the mentioned

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

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

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

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

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

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

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

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

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

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

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

Question 21

If we preempt a resource from a process, the process cannot continue with its normal execution and it must be___________

A)aborted
B)rolled back
C)terminated
D)queued

Question 22

To___________to a safe state, the system needs to keep more information about the states of processes.

A)abort the process
B)roll back the process
C)queue the process
D)none of the mentioned

Question 23

If the resources are always preempted from the same process___________      can occur.

A)deadlock
B)system crash
C)aging
D)starvation

Question 24

What is the solution to starvation?

A)the number of rollbacks must be included in the cost factor
B)the number of resources must be included in resource preemption
C)resource preemption be done instead
D)all of the mentioned

Question 25

What is Address Binding?

A)going to an address in memory
B)locating an address with the help of another address
C)binding two addresses together to form a new address in a different memory space
D)a mapping from one address space to another