solution - DBMS (Database Management System) : Concurrency Control (Test 1)

Question : Which of the following best describes the main advantage of the Thomas Write Rule over basic timestamp ordering?

Solution :
298620260429085103 Correct Answer : Reduces unnecessary transaction aborts

Description -

DBMS (Database Management System) : Concurrency Control (Test 1)

Question : Why is the Thomas Write Rule considered more flexible than the basic timestamp ordering protocol?

Solution :
965220260429084957 Correct Answer : It ignores certain obsolete write operations

Description -

DBMS (Database Management System) : Concurrency Control (Test 1)

Question : Which type of serializability is always ensured by the Thomas Write Rule?

Solution :
782920260429084907 Correct Answer : View serializability

Description -

DBMS (Database Management System) : Concurrency Control (Test 1)

Question : Which of the following is NOT a characteristic of validation-based protocol?

Solution :
748320260429084759 Correct Answer : Requires locking of data items

Description -

DBMS (Database Management System) : Concurrency Control (Test 1)

Question : Which scenario leads to poor performance of validation-based protocols?

Solution :
830520260429084722 Correct Answer : Frequent conflicts among transactions

Description -

DBMS (Database Management System) : Concurrency Control (Test 1)

Question : Why is the timestamp of the validation phase often used for serialization order?

Solution :
626120260429084634 Correct Answer : Because validation phase decides commit or rollback

Description -

DBMS (Database Management System) : Concurrency Control (Test 1)

Question : In a validation-based protocol, which phase determines whether a transaction will commit or rollback?

Solution :
213220260429084540 Correct Answer : Validation Phase

Description -

DBMS (Database Management System) : Concurrency Control (Test 1)

Question : Why are older transactions given higher priority in Timestamp Ordering?

Solution :
116320260429084427 Correct Answer : To maintain serializability based on timestamp order

Description -

DBMS (Database Management System) : Concurrency Control (Test 1)

Question : Which statement is NOT correct about Timestamp Ordering Protocol?

Solution :
885620260429084349 Correct Answer : It always produces recoverable schedules

Description -

DBMS (Database Management System) : Concurrency Control (Test 1)

Question : Which of the following ensures that the Timestamp Ordering Protocol is deadlock-free?

Solution :
866920260429084259 Correct Answer : Transactions are rolled back instead of waiting

Description -

DBMS (Database Management System) : Concurrency Control (Test 1)

Question : In 2PL, the point where a transaction has acquired all required locks and enters shrinking phase is called:

Solution :
688320260429081417 Correct Answer : Lock point

Description -

DBMS (Database Management System) : Concurrency Control (Test 1)

Question : Which of the following problems can still occur in basic lock-based protocols (including 2PL)?

Solution :
540320260429081339 Correct Answer : Deadlock

Description -

DBMS (Database Management System) : Concurrency Control (Test 1)

Question : What is the main difference between 2PL and Strict 2PL?

Question : Which protocol ensures deadlock prevention by requesting all locks before execution begins?

Solution :
276120260429081229 Correct Answer : Pre-claiming Lock Protocol

Description -

DBMS (Database Management System) : Concurrency Control (Test 1)

Question : Which of the following statements about Two-Phase Locking (2PL) is correct?

Solution :
309220260429081141 Correct Answer : No locks can be released in the growing phase

Description -

DBMS (Database Management System) : Concurrency Control (Test 1)

Question : Which concurrency control technique allows transactions to proceed without locks initially and checks conflicts at commit time?

Solution :
198220260429081034 Correct Answer : Optimistic concurrency control

Description -

DBMS (Database Management System) : Concurrency Control (Test 1)

Question : Which of the following statements about Two-Phase Locking (2PL) is correct?

Solution :
870320260429080948 Correct Answer : Once a lock is released, no new lock can be acquired

Description -

DBMS (Database Management System) : Concurrency Control (Test 1)

Question : Which anomaly is NOT possible under Serializable isolation level?

Solution :
517220260429080916 Correct Answer : All of the above

Description -

DBMS (Database Management System) : Concurrency Control (Test 1)

Question : In timestamp ordering protocol, a transaction is rolled back if:

Solution :
112320260429080823 Correct Answer : Its timestamp is smaller than the write timestamp of the data item

Description -

DBMS (Database Management System) : Concurrency Control (Test 1)

Question : Which of the following schedules is recoverable but not cascadeless?

Solution :
719620260429080746 Correct Answer : A schedule where a transaction reads uncommitted data but commits after the writer commits

Description -

DBMS (Database Management System) : Concurrency Control (Test 1)