This set of Operating System Multiple Choice Questions & Answers (MCQs) focuses on “Atomic Transactions”.
1. A collection of instructions that performs a single logical function is called ____________
a) transaction
b) operation
c) function
d) all of the mentioned
View Answer
Explanation: None.
2. A terminated transaction that has completed its execution successfully is ____________ otherwise it is __________
a) committed, destroyed
b) aborted, destroyed
c) committed, aborted
d) none of the mentioned
View Answer
Explanation: None.
3. 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.
a) safety
b) protection
c) roll – back
d) revert – back
View Answer
Explanation: None.
4. Write ahead logging is a way ____________
a) to ensure atomicity
b) to keep data consistent
c) that records data on stable storage
d) all of the mentioned
View Answer
Explanation: None.
5. In the write ahead logging a _____________ is maintained.
a) a memory
b) a system
c) a disk
d) a log record
View Answer
Explanation: None.
6. An actual update is not allowed to a data item ____________
a) before the corresponding log record is written out to stable storage
b) after the corresponding log record is written out to stable storage
c) until the whole log record has been checked for inconsistencies
d) all of the mentioned
View Answer
Explanation: None.
7. The undo and redo operations must be _________ to guarantee correct behaviour, even if a failure occurs during recovery process.
a) idempotent
b) easy
c) protected
d) all of the mentioned
View Answer
Explanation: Idempotent – Multiple executions of an operation have the same result as does one execution.
8. The system periodically performs checkpoints that consists of the following operation(s) ____________ 9. 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 ____________ 10. Serializable schedules are ones where ____________ 11. A locking protocol is one that ____________ 12. The two phase locking protocol consists of ____________ 13. The growing phase is a phase in which? 14. The shrinking phase is a phase in which? 15. Which of the following concurrency control protocols ensure both conflict serializability and freedom from deadlock? Sanfoundry Global Education & Learning Series – Operating System. To practice all areas of Operating System, here is complete set on 1000+ Multiple Choice Questions and Answers on Operating System.
a) Putting all the log records currently in main memory onto stable storage
b) putting all modified data residing in main memory onto stable storage
c) putting a log record
d) all of the mentioned
View Answer
Explanation: None.
a) There is a need to perform an undo operation on T1
b) There is a need to perform a redo operation on T1
c) There is no need to perform an undo and redo operation on T1
d) All of the mentioned
View Answer
Explanation: None.
a) concurrent execution of transactions is equivalent to the transactions executed serially
b) the transactions can be carried out one after the other
c) a valid result occurs after execution transactions
d) none of the mentioned
View Answer
Explanation: None.
a) governs how locks are acquired
b) governs how locks are released
c) governs how locks are acquired and released
d) none of the mentioned
View Answer
Explanation: None.
a) growing & shrinking phase
b) shrinking & creation phase
c) creation & growing phase
d) destruction & creation phase
View Answer
Explanation: None.
a) A transaction may obtain locks, but does not release any
b) A transaction may obtain locks, and releases a few or all of them
c) A transaction may release locks, but does not obtain any new locks
d) A transaction may release locks, and does obtain new locks
View Answer
Explanation: None.
a) A transaction may obtain locks, but does not release any
b) A transaction may obtain locks, and releases a few or all of them
c) A transaction may release locks, but does not obtain any new locks
d) A transaction may release locks, and does obtain new locks
View Answer
Explanation: None.
I) 2-phase locking
II) Timestamp ordering
a) I only
b) II only
c) Both I and II
d) Neither I nor II
View Answer
Explanation: None.