Explore topic-wise MCQs in Rdbms.

This section includes 11 Mcqs, each offering curated multiple-choice questions to sharpen your Rdbms knowledge and support exam preparation. Choose a topic below to get started.

1.

State true or false: Exclusive locks are held until transaction commit in degree two consistency

A. True
B. False
Answer» B. False
2.

Which of the following does cursor stability ensure

A. The tuple that is currently being processed by the iteration is locked in shared mode
B. The tuple that is currently being processed is not locked in shared mode
C. Any modified tuples are not locked in exclusive mode
D. None of the mentioned
Answer» B. The tuple that is currently being processed is not locked in shared mode
3.

STATE_TRUE_OR_FALSE:_EXCLUSIVE_LOCKS_ARE_HELD_UNTIL_TRANSACTION_COMMIT_IN_DEGREE_TWO_CONSISTENCY?$

A. True
B. False
Answer» B. False
4.

Which of the following does cursor stability ensur?

A. The tuple that is currently being processed by the iteration is locked in shared mode
B. The tuple that is currently being processed is not locked in shared mode
C. Any modified tuples are not locked in exclusive mode
D. None of the mentioned
Answer» B. The tuple that is currently being processed is not locked in shared mode
5.

To prevent the phantom phenomenon, _______ is used

A. Key value locking
B. Next key locking
C. Previous key locking
D. None of the mentioned
Answer» C. Previous key locking
6.

State true or false: Key value locking provides increased concurrency

A. True
B. False
Answer» B. False
7.

Transactions that involve user interactions are called __________

A. Validations
B. Conversations
C. Interfaces
D. None of the mentioned
Answer» C. Interfaces
8.

_________ is a form of two degree consistency designed for programs that iterate over tuples of a relation by using cursors.

A. Cursor stability
B. Serializability
C. Non-serializability
D. Predicate locking
Answer» B. Serializability
9.

Which of the following is included in the operational mechanism of the index locking protocol?

A. Every transaction must have at least one index
B. A transaction that performs a lookup must acquire a shared lock on all the index leaf nodes that it accesses
C. The rule of the two phase locking mechanism must be observed
D. All of the mentioned
Answer» E.
10.

Which of the following does not lock the entire index

A. Phantom locking
B. Phantom problem
C. Index locking
D. Index problem
Answer» D. Index problem
11.

________ deletes a data item from a database

A. Delete(Q)
B. Insert(Q)
C. Drop(Q)
D. None of the mentioned
Answer» B. Insert(Q)