Concurrency in Index Structures Multiple Choice Questions with Answers – PDF Download

MCQ 1: The system must deal with the deadlocks that are not prevented by using schemes of:

1. Validation
2. Deadlock detection
3. Deadlock recovery
4. Both A and B

MCQ 2: A scheme that creates a new version of a data item for each transaction is defined by:

1. Concurrency control scheme
2. Multiversion concurrency control scheme
3. Timestamp concurrency control scheme
4. Wound concurrency control scheme

MCQ 3: A transaction that is inserting a new tuple into the database is given an:

1. Shared lock
2. Mutual lock
3. Exclusive lock
4. NO lock

MCQ 4: Concurrency control is a challenging task for transactions that have:

1. Application accesses
2. I/O activities
3. User interactions
4. Application interactions

MCQ 5: In preemption technique, transactions are assigned a unique timestamp to decide whether it should wait or:

1. Executed
2. Committed
3. Aborted
4. Rolled back