Operating System MCQs

1019 MCQs  (Page 97 of 102)

In distributed systems, what will the transaction coordinator do?
A. Starts the execution of transaction
B. Breaks the transaction into number of sub transactions
C. Coordinates the termination of the transaction
D. All of the mentioned
In case of failure, a new transaction coordinator can be elected by ____________
A. Bully algorithm
B. Ring algorithm
C. Both bully and ring algorithm
D. None of the mentioned
In distributed systems, election algorithms assumes that ____________
A. A unique priority number is associated with each active process in system
B. There is no priority number associated with any process
C. Priority of the processes is not required
D. None of the mentioned
According to the ring algorithm, links between processes are ____________
A. Bidirectional
B. Unidirectional
C. Both bidirectional and unidirectional
D. None of the mentioned
The number of resources requested by a process ____________
A. Must always be less than the total number of resources available in the system
B. Must always be equal to the total number of resources available in the system
C. Must not exceed the total number of resources available in the system
D. Must exceed the total number of resources available in the system
The request and release of resources are ___________
A. Command line statements
B. Interrupts
C. System calls
D. Special programs
What are Multithreaded programs?
A. Lesser prone to deadlocks
B. More prone to deadlocks
C. Not at all prone to deadlocks
D. None of the mentioned
For a deadlock to arise, which of the following conditions must hold simultaneously?
A. Mutual exclusion
B. No preemption
C. Hold and wait
D. All of the mentioned
For Mutual exclusion to prevail in the system ____________
A. At least one resource must be held in a non sharable mode
B. The processor must be a uniprocessor rather than a multiprocessor
C. There must be at least one resource in a sharable mode
D. All of the mentioned