Consider a transaction T1 that committed prior to checkpoint. The record appears in the log before the 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 ____________

There is a need to perform an undo operation on T1

There is a need to perform a redo operation on T1

There is no need to perform an undo and redo operation on T1

All of the mentioned

There is no need to perform an undo and redo operation on T1

OS Process Synchronization Author: rikazzz

A. there is only one buffer

B. there are n buffers ( n being greater than one but finite)

C. there are infinite buffers

D. the buffer size is bounded

A. one

B. two

C. three

D. four

A. count the number of empty and full buffers

B. count the number of empty and full memory spaces

C. count the number of empty and full queues

D. none of the mentioned

A. Readers – Writers problem

B. Dining – Philosophers problem

C. Producer – Consumer problem

D. None of the mentioned

A. its magnitude is the number of processes waiting on that semaphore

B. it is invalid

C. no operation can be further performed on it until the signal operation is performed on it

D. none of the mentioned

A. only one process can be active at a time within the monitor

B. n number of processes can be active at a time within the monitor (n being greater than 1)

C. the queue has only one process in it at a time

D. all of the mentioned

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

Related posts