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 join returns all rows from the left table and matching rows from the right table?
- A programmer is trying to debug an issue where an `ArrayList` (or equivalent dynamic array) in their Java/Python code unexpectedly throws an `IndexOutOfBo...
- You have a Python list of fruits and want to extract a specific sub-list using slicing. Complete the missing part of the code to obtain the sub-list `['b...
- 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 a type of phishing attack?
- Which of the following correctly describes a 'primary key' in a relational database?
- Which key uniquely identifies a record in a table?
- In a database with a foreign key constraint defined using "ON DELETE CASCADE," what happens when a row in the parent (referenced) table is deleted?
- Under READ COMMITTED isolation, Transaction T1 executes a query 'SELECT * FROM Accounts WHERE balance > 50000' and gets 5 rows. Before T1 re-executes the i...
- Which type of SQL JOIN returns all records from both tables, filling unmatched fields with NULL?
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)