Operating System MCQ (Multiple Choice Questions) - SchoolingAxis

Operating System MCQ (Multiple Choice Questions)

 Que- For sharable resources, mutual exclusion : 

a. is required 

b. is not required 

c. may be or may not be required 

d. none of the mentioned 


Answer- is not required        


Que- To ensure that the hold and wait condition never occurs in the system, it must be ensured that : 

a. whenever a resource is requested by a process, it is not holding any other resources 

b. each process must request and be allocated all its resources before it begins its execution 

c. a process can request resources only when it has none 

d. all of the mentioned 


Answer- all of the mentioned        


Que- The disadvantage of a process being allocated all its resources before beginning its execution is : 

a. Low CPU utilization 

b. Low resource utilization 

c. Very high resource utilization 

d. None of the mentioned 


Answer- Low resource utilization        


Que- To ensure no preemption, if a process is holding some resources and requests another resource that cannot be immediately allocated to it : 

a. then the process waits for the resources be allocated to it 

b. the process keeps sending requests until the resource is allocated to it 

c. the process resumes execution without the resource being allocated to it 

d. then all resources currently being held are preempted 


Answer- then all resources currently being held are preempted        


Que- One way to ensure that the circular wait condition never holds is to : 

a. impose a total ordering of all resource types and to determine whether one precedes another in the ordering 

b. to never let a process acquire resources that are held by other processes 

c. to let a process wait for only one resource at a time 

d. all of the mentioned 


Answer- impose a total ordering of all resource types and to determine whether one precedes another in the ordering        


Que- 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. 

a. resources currently available 

b. processes that have previously been in the system 

c. resources currently allocated to each process 

d. future requests and releases of each process 


Answer- resources currently available        


Que- 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. minimum 

b. average 

c. maximum 

d. approximate 


Answer- maximum        


Que- A deadlock avoidance algorithm dynamically examines the __________ to ensure that a circular wait condition can never exist. 

a. resource allocation state 

b. system storage state 

c. operating system 

d. resources 


Answer- resource allocation state        


Que- A state is safe, if : 

a. the system does not crash due to deadlock occurrence 

b. the system can allocate resources to each process in some order and still avoid a deadlock 

c. the state keeps the system protected and safe 

d. all of the mentioned 


Answer- the system can allocate resources to each process in some order and still avoid a deadlock        


Que- A system is in a safe state only if there exists a : 

a. safe allocation 

b. safe resource 

c. safe sequence 

d. all of the mentioned 


Answer- safe sequence        


Que- All unsafe states are : 

a. deadlocks 

b. not deadlocks 

c. fatal 

d. none of the mentioned 


Answer- not deadlocks        


Que- 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- then the system will be in a safe state        


Que- 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 instance of each resource type 

d. none of the mentioned 


Answer- with multiple instances of each resource type        


Que- The Banker's algorithm is _____________ than the resource allocation graph algorithm. 

a. less efficient 

b. more efficient 

c. equal 

d. none of the mentioned 


Answer- less efficient        


Que- The data structures available in the Banker's algorithm are : 

a. Available 

b. Need 

c. Allocation 

d. All of the mentioned 


Answer- All of the mentioned        


Que- The content of the matrix Need is : 

a. Allocation - Available 

b. Max - Available 

c. Max - Allocation 

d. Allocation - Max 


Answer- Max - Allocation        


Que- What is the reusable resource? 

a. that can be used by one process at a time and is not depleted by that use 

b. that can be used by more than one process at a time 

c. that can be shared between various threads 

d. none of the mentioned  


Answer- that can be used by one process at a time and is not depleted by that use        


Que- 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 instance 

d. all of the mentioned 


Answer- all resources have a single instance        


Que- 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 


Answer- Pi is waiting for Pj to release a resource that Pi needs        


Que- 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 


Answer- then a deadlock exists        


Que- If deadlocks occur frequently, the detection algorithm must be invoked ________ 

a. rarely 

b. frequently 

c. rarely & frequently 

d. none of the mentioned 


Answer- frequently        


Que- The disadvantage of invoking the detection algorithm for every request is : 

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 


Answer- considerable overhead in computation time        


Que- 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 


Answer- drop        


Que- 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 


Answer- the set of processes that have been deadlocked        


Que- 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 


Answer- 2        


Que- 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 


Answer- can never occur        


Que- '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 


Answer- can never occur        


Que- 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 


Answer- abort one or more processes to break the circular wait        


Que- 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 


Answer- Abort one process at a time until the deadlock cycle is eliminated        


Que- 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 


Answer- incurs minimum cost        


Que- 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 


Answer- all of the mentioned        


Que- Cost factors of 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 


Answer- Amount of time a deadlocked process has thus far consumed during its execution        


Que- 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 


Answer- rolled back        


Que- 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 


Answer- roll back the process        


Que- If the resources are always preempted from the same process, __________ can occur. 

a. deadlock 

b. system crash 

c. aging 

d. starvation 


Answer- starvation        


Que- The solution to starvation is : 

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 


Answer- the number of rollbacks must be included in the cost factor        


Que- Address Binding is : 

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 


Answer- a mapping from one address space to another        


Que- Binding of instructions and data to memory addresses can be done at : 

a. Compile time 

b. Load time 

c. Execution time 

d. All of the mentioned 


Answer- All of the mentioned        


Que- If the process can be moved during its execution from one memory segment to another, then binding must be : 

a. delayed until run time 

b. preponed to compile time 

c. preponed to load time 

d. none of the mentioned 


Answer- delayed until run time        


Que- Dynamic loading is : 

a. loading multiple routines dynamically 

b. loading a routine only when it is called 

c. loading multiple routines randomly 

d. none of the mentioned 


Answer- loading a routine only when it is called        


Que- The advantage of dynamic loading is that : 

a. A used routine is used multiple times 

b. An unused routine is never loaded 

c. CPU utilization increases 

d. All of the mentioned 


Answer- An unused routine is never loaded        


Que- The idea of overlays is to : 

a. data that are needed at any given time 

b. enable a process to be larger than the amount of memory allocated to it 

c. keep in memory only those instructions 

d. all of the mentioned 


Answer- all of the mentioned        


Que- The ___________ must design and program the overlay structure. 

a. programmer 

b. system architect 

c. system designer 

d. none of the mentioned 


Answer- programmer        


Previous Post Next Post

Responsive Ad