a) using very large time slices converts it into First come First served scheduling algorithm
b) using very small time slices converts it into First come First served scheduling algorithm
c) using extremely small time slices increases performance
d) using very small time slices converts it into Shortest Job First algorithm
Answer: a
Explanation: All the processes will be able to get completed.
Related Posts
Consider a transaction T1 that committed prior to checkpoint. The <T1 commits> record appears in the log before the <checkpoint> record. Any modifications made by T1 must have been written to the stable storage either with the checkpoint or prior to it. Thus at recovery time ____________
The system periodically performs checkpoints that consists of the following operation(s) ____________
The undo and redo operations must be _________ to guarantee correct behaviour, even if a failure occurs during recovery process.
An actual update is not allowed to a data item ____________
In the write ahead logging a _____________ is maintained.
Write ahead logging is a way ____________
The state of the data accessed by an aborted transaction must be restored to what it was just before the transaction started executing. This restoration is known as ________ of transaction.
Join The Discussion