Operating System Set 14

Computer Science Engineering (CSE),

Information Technology Engineering (IT),

Bachelor of Science in Computer Science FY (BSc CS),

Bachelor of Computer Applications (BCA),

Bachelor of Science in Computer Science (BSc CS)

Learning Mode Previous Next
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                          
Q2 | If no cycle exists in the resource allocation graph                          
Q3 | The resource allocation graph is not applicable to a resource allocation system
Q4 | The data structures available in the Banker’s algorithm are                          
Q5 | The content of the matrix Need is
Q6 | The wait-for graph is a deadlock detection algorithm that is applicable when
Q7 | An edge from process Pi to Pj in a wait for graph indicates that                          
Q8 | If the wait for graph contains a cycle
Q9 | If deadlocks occur frequently, the detection algorithm must be invoked                  
Q10 | What is the disadvantage of invoking the detection algorithm for every request?
Q11 | A deadlock eventually cripples system throughput and will cause the CPU utilization to              
Q12 | Every time a request for allocation cannot be granted immediately, the detection algorithm is invoked. This will help identify
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?
Q14 | A system has 3 processes sharing 4 resources. If each process needs a maximum of 2 units then, deadlock                          
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                          
Q16 | A deadlock can be broken by
Q17 | The two ways of aborting processes and eliminating deadlocks are                          
Q18 | Those processes should be aborted on occurrence of a deadlock, the termination of which?
Q19 | The process to be aborted is chosen on the basis of the following factors?
Q20 | Cost factors for process termination include                          
Q21 | If we preempt a resource from a process, the process cannot continue with its normal execution and it must be                          
Q22 | To                to a safe state, the system needs to keep more information about the states of processes.
Q23 | If the resources are always preempted from the same process                      can occur.
Q24 | What is the solution to starvation?
Q25 | What is Address Binding?
Previous Next