Operating System MCQs
1K+ questions with answers
Each request requires that the system consider the _____________ to decide whether the current request can be satisfied or must wait to avoid a future possible deadlock.
Given a priori information about the ________ number of resources of each type that maybe requested for each process, it is possible to construct an algorithm that ensures that the system will never enter a deadlock state.
A deadlock avoidance algorithm dynamically examines the __________ to ensure that a circular wait condition can never exist.
A state is safe, if ____________
A system is in a safe state only if there exists a ____________
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 Banker’s algorithm is _____________ than the resource allocation graph algorithm.
The data structures available in the Banker’s algorithm are ____________
A system with 5 processes P0 through P4 and three resource types A, B, C have A with 10 instances, B with 5 instances, and C with 7 instances. At time t0, the following snapshot has been taken: Process P0 P1 P2 P3 P4 Allocation (process-wise : P0 through P4 top TO bottom) A B C 0 1 0 2 0 0 3 0 2 2 1 1 0 0 2 MAX (process-wise: P0 through P4 top TO bottom) A B C 7 5 3 3 2 2 9 0 2 2 2 2 4 3 3 Available A B C 3 3 2
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 ______
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 ____________
If we preempt a resource from a process, the process cannot continue with its normal execution and it must be ____________
If the resources are always preempted from the same process __________ can occur.
What is the solution to starvation?
What is Address Binding?
Binding of instructions and data to memory addresses can be done at ____________
If the process can be moved during its execution from one memory segment to another, then binding must be ____________
What is Dynamic loading?
What is the advantage of dynamic loading?
The idea of overlays is to ____________
The ___________ swaps processes in and out of the memory.
If a higher priority process arrives and wants service, the memory manager can swap out the lower priority process to execute the higher priority process. When the higher priority process finishes, the lower priority process is swapped back in and continues execution. This variant of swapping is sometimes called?
If binding is done at assembly or load time, then the process _____ be moved to different locations after being swapped out and in again.
In a system that does not support swapping ____________
Which of the following is TRUE?
The address generated by the CPU is referred to as ____________
The address loaded into the memory address register of the memory is referred to as ____________
The run time mapping from virtual to physical addresses is done by a hardware device called the ____________
The base register is also known as the ____________
The size of a process is limited to the size of ____________
If execution time binding is being used, then a process ______ be swapped to a different memory space.
The backing store is generally a ____________
The ________ consists of all processes whose memory images are in the backing store or in memory and are ready to run.
The _________ time in a swap out of a running process and swap in of a new process into the memory is very high.
The major part of swap time is _______ time.
Swapping _______ be done when a process has pending I/O, or has to execute I/O operations only into operating system buffers.