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 of the following illustrates an advantage of DBMS over traditional file systems?
- Which of the following is a DML command?
- A relation has 5 attributes in total, and the single attribute {A} forms its only candidate key. What is the maximum number of possible superkeys (includin...
- A relation R(A, B, C) has functional dependencies A→B, B→C, and B→A, with {A} and {B} both being candidate keys of R. Which of the following statements abo...
- What is a 'transaction' in DBMS and what does 'COMMIT' do?
- Transaction T1 updates a row but has not yet committed. Transaction T2 reads this same row's uncommitted new value. T1 then rolls back, meaning T2 has read...
- Query optimization heuristic that “pushes selections down” improves:
- Which SQL keyword is used to combine the result sets of two or more SELECT statements, automatically removing duplicate rows from the combined result?
- A 'Dependent' entity (e.g., an employee's dependents) has no standalone primary key and always depends on 'Employee' for identification. When converting th...
- 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)