On This Page

This set of Operating System (OS) Multiple Choice Questions & Answers (MCQs) focuses on Operating System Set 14

Q1 | All unsafe states are                          
  • deadlocks
  • not deadlocks
  • fatal
  • none of the mentioned
Q2 | If no cycle exists in the resource allocation graph                          
  • then the system will not be in a safe state
  • then the system will be in a safe state
  • all of the mentioned
  • none of the mentioned
Q3 | The resource allocation graph is not applicable to a resource allocation system
  • with multiple instances of each resource type
  • with a single instance of each resource type
  • single & multiple instances of each resource type
  • none of the mentioned
Q4 | The data structures available in the Banker’s algorithm are                          
  • available
  • need
  • allocation
  • all of the mentioned
Q5 | The content of the matrix Need is
  • allocation – available
  • max – available
  • max – allocation
  • allocation – max
Q6 | The wait-for graph is a deadlock detection algorithm that is applicable when
  • all resources have a single instance
  • all resources have multiple instances
  • all resources have a single 7 multiple instances
  • all of the mentioned
Q7 | 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
  • pj is waiting for pi to release a resource that pj needs
  • pi is waiting for pj to leave the system
  • pj is waiting for pi to leave the system
Q8 | If the wait for graph contains a cycle
  • then a deadlock does not exist
  • then a deadlock exists
  • then the system is in a safe state
  • either deadlock exists or system is in a safe state
Q9 | If deadlocks occur frequently, the detection algorithm must be invoked                  
  • rarely
  • frequently
  • rarely & frequently
  • none of the mentioned
Q10 | What is the disadvantage of invoking the detection algorithm for every request?
  • overhead of the detection algorithm due to consumption of memory
  • excessive time consumed in the request to be allocated memory
  • considerable overhead in computation time
  • all of the mentioned
Q11 | A deadlock eventually cripples system throughput and will cause the CPU utilization to              
  • increase
  • drop
  • stay still
  • none of the mentioned
Q12 | Every time a request for allocation cannot be granted immediately, the detection algorithm is invoked. This will help identify
  • the set of processes that have been deadlocked
  • the set of processes in the deadlock queue
  • the specific process that caused the deadlock
  • all of the mentioned
Q13 | 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?
  • 2
  • 3
  • 4
  • 1
Q14 | A system has 3 processes sharing 4 resources. If each process needs a maximum of 2 units then, deadlock                          
  • can never occur
  • may occur
  • has to occur
  • none of the mentioned
Q15 | ‘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                          
  • can never occur
  • may occur
  • has to occur
  • none of the mentioned
Q16 | A deadlock can be broken by
  • abort one or more processes to break the circular wait
  • abort all the process in the system
  • preempt all resources from all processes
  • none of the mentioned
Q17 | The two ways of aborting processes and eliminating deadlocks are                          
  • abort all deadlocked processes
  • abort all processes
  • abort one process at a time until the deadlock cycle is eliminated
  • all of the mentioned
Q18 | Those processes should be aborted on occurrence of a deadlock, the termination of which?
  • is more time consuming
  • incurs minimum cost
  • safety is not hampered
  • all of the mentioned
Q19 | The process to be aborted is chosen on the basis of the following factors?
  • priority of the process
  • process is interactive or batch
  • how long the process has computed
  • all of the mentioned
Q20 | Cost factors for process termination include                          
  • number of resources the deadlock process is not holding
  • cpu utilization at the time of deadlock
  • amount of time a deadlocked process has thus far consumed during its execution
  • all of the mentioned
Q21 | If we preempt a resource from a process, the process cannot continue with its normal execution and it must be                          
  • aborted
  • rolled back
  • terminated
  • queued
Q22 | To                to a safe state, the system needs to keep more information about the states of processes.
  • abort the process
  • roll back the process
  • queue the process
  • none of the mentioned
Q23 | If the resources are always preempted from the same process                      can occur.
  • deadlock
  • system crash
  • aging
  • starvation
Q24 | What is the solution to starvation?
  • the number of rollbacks must be included in the cost factor
  • the number of resources must be included in resource preemption
  • resource preemption be done instead
  • all of the mentioned
Q25 | What is Address Binding?
  • going to an address in memory
  • locating an address with the help of another address
  • binding two addresses together to form a new address in a different memory space
  • a mapping from one address space to another