Question
In DBMS concurrency control, a 'wait-for graph' is constructed with transactions as nodes and directed edges representing which transaction is waiting for a lock held by another. A deadlock among the transactions is confirmed to exist precisely when this graph contains:
More IT DBMS Questions
- Which type of relationship exists when a record in one table can relate to multiple records in another table, and vice versa?
- A relation has 6 attributes in total, and the single attribute {A} forms its only candidate key. What is the maximum number of possible superkeys (includin...
- If every non-key attribute is functionally dependent on the primary key, the relation will be in
- What does the acronym ACID stand for in the context of database transaction management?
- What will be the output of the following Python code: a=[1,2,3,4,5,6] print(a[-1],a[-1:],a[:-1])
- Which normal form ensures no partial dependency of non-prime attributes on a candidate key?
- Which of these ensures referential integrity?
- A transaction that reads a value then later sees a different value because another transaction updated and committed in between experiences which anomaly?
- Which of the following is true about the primary key in a relational database?
- A programmer is trying to debug an issue where an `ArrayList` (or equivalent dynamic array) in their Java/Python code unexpectedly throws an `IndexOutOfBo...
Hey! Ask a query
Please enter email id
The email must be a valid email address.
Please enter Mobile Number
Please enter valid Mobile Number
Please enter your Doubt
Think You're Ready for RBI Grade B?
RBI Grade B 2026 Phase 1 Memory Based Paper
- 200 Questions with Detailed Solutions
- Section-wise Coverage (GA, English, Quant & Reasoning)