Question
A relation R(A, B, C,
- D has functional dependencies A -> B, A -> C, and C -> D, with A as the only candidate key. What is the highest normal form satisfied by this relation?
More IT DBMS Questions
- Which normal form removes transitive dependency?
- Transaction T1 holds a lock on Row A and requests a lock on Row B. Transaction T2 holds a lock on Row B and requests a lock on Row A. Both use strict Two-P...
- Which type of join returns rows when there is a match in both tables?
- A transaction T1 updates a row and then waits for a lock held by T2. T2 is waiting for a lock held by T1. What condition has occurred?
- A relation R(A, B, C, D) has the functional dependencies AB -> C, C -> D and D -> A. How many candidate keys does R have?
- What will be the value of `x` after the following pseudo-code execution? ``` x = 0 data = [10, 20, 30] for item in data: if item ...
- Which deadlock prevention scheme allows older transactions to preempt younger ones?
- In a 'clustered' index on a database table, what distinguishes it from a non-clustered index?
- Which join should be used when you want to list all customers and any orders they may have placed, including customers who haven’t placed any orders?
- Multiple transactions execute concurrently on a database, yet each transaction behaves as though it is the only one running, and is shielded from seeing an...
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)