solution - DBMS (Database Management System) : Transaction (Test 2)

Question : Why is view serializability harder to test than conflict serializability?

Solution :
628620260428072815 Correct Answer : It involves checking multiple equivalence conditions and is computationally complex

Description -

DBMS (Database Management System) : Transaction (Test 2)

Question : Which of the following is NOT required for checking view serializability?

Solution :
967720260428072658 Correct Answer : Precedence graph acyclicity

Description -

DBMS (Database Management System) : Transaction (Test 2)

Question : A schedule that is not conflict serializable but is view serializable must contain:

Solution :
568120260428072619 Correct Answer : Blind writes

Description -

DBMS (Database Management System) : Transaction (Test 2)

Question : Which statement is TRUE regarding view serializability?

Solution :
430720260428072536 Correct Answer : Every conflict serializable schedule is view serializable

Description -

DBMS (Database Management System) : Transaction (Test 2)

Question : Which of the following conditions must hold for two schedules to be view equivalent?

Solution :
74820260428072432 Correct Answer : Same initial reads, same final writes, same read-from relations

Description -

DBMS (Database Management System) : Transaction (Test 2)

Question : Which statement is true regarding redo operations in deferred update?

Solution :
880120260428072107 Correct Answer : Redo is idempotent (safe to repeat)

Description -

DBMS (Database Management System) : Transaction (Test 2)

Question : What is the role of a checkpoint in log-based recovery?

Solution :
17920260428072029 Correct Answer : It reduces recovery time by limiting log scanning

Description -

DBMS (Database Management System) : Transaction (Test 2)

Question : In immediate update with undo/redo, which transactions are undone during recovery?

Solution :
831520260428071924 Correct Answer : Transactions without a commit record

Description -

DBMS (Database Management System) : Transaction (Test 2)

Question : Which of the following correctly describes deferred database modification?

Solution :
956220260428071830 Correct Answer : Updates are written only after transaction commits

Description -

DBMS (Database Management System) : Transaction (Test 2)

Question : In log-based recovery, why must log records be written to stable storage before the actual database modification?

Solution :
582020260428071745 Correct Answer : To ensure atomicity and durability using Write-Ahead Logging

Description -

DBMS (Database Management System) : Transaction (Test 2)

Question : Which of the following correctly describes redo and undo lists in checkpoint-based recovery?

Solution :
772020260428071229 Correct Answer : Redo list contains committed transactions, undo list contains incomplete ones

Description -

DBMS (Database Management System) : Transaction (Test 2)

Question : After a system crash, from where does recovery typically start when checkpoints are used?

Solution :
751320260428071151 Correct Answer : Last checkpoint

Description -

DBMS (Database Management System) : Transaction (Test 2)

Question : Which type of checkpoint allows transactions to continue execution during checkpointing?

Solution :
632320260428071057 Correct Answer : Fuzzy checkpoint

Description -

DBMS (Database Management System) : Transaction (Test 2)

Question : During checkpoint execution, which of the following operations is performed?

Solution :
71420260428071007 Correct Answer : Dirty buffers are written to disk and checkpoint record is logged

Description -

DBMS (Database Management System) : Transaction (Test 2)

Question : Which of the following is the primary purpose of a checkpoint in DBMS?

Solution :
966620260428070922 Correct Answer : To reduce recovery time after system failure

Description -

DBMS (Database Management System) : Transaction (Test 2)

Question : Which of the following is a key disadvantage of deadlock prevention techniques like Wait-Die and Wound-Wait?

Solution :
339320260428070815 Correct Answer : They may unnecessarily abort transactions

Description -

DBMS (Database Management System) : Transaction (Test 2)

Question : Which statement is correct regarding Wound-Wait scheme?

Solution :
413620260428070701 Correct Answer : Older transaction can force younger to abort

Description -

DBMS (Database Management System) : Transaction (Test 2)

Question : In the Wait-Die scheme, what happens when a younger transaction requests a resource held by an older transaction?

Solution :
630720260428070554 Correct Answer : Younger transaction aborts

Description -

DBMS (Database Management System) : Transaction (Test 2)

Question : In a wait-for graph, deadlock exists if:

Solution :
899920260428070503 Correct Answer : There is a cycle in the graph

Description -

DBMS (Database Management System) : Transaction (Test 2)

Question : Which of the following is NOT a necessary condition for deadlock in DBMS?

Solution :
740820260428070434 Correct Answer : Preemption allowed

Description -

DBMS (Database Management System) : Transaction (Test 2)