Question
A relation R(A, B, C,
- D has the composite candidate key {A, B}, and the functional dependencies AB→C and C→D hold, where C fully depends on the entire key {A,B} (no partial dependency exists). What is the highest normal form that R satisfies?
More IT DBMS Questions
- 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...
- Which normal form ensures a table has no transitive dependency between its non-key attributes?
- Which of the following is NOT a common type of error encountered during software development?
- A relational database management system needs to store millions of employee records on disk and support fast search, insertion, deletion, and range queries...
- Transaction T1 is waiting for a resource held by T2, T2 is waiting for a resource held by T3, T3 is waiting for a resource held by T1, and separately T4 is...
- Which SQL statement is used to remove all rows from a table without logging individual row deletions?
- What does the ‘’ element in HTML5 allow you to do?
- What does the SQL COMMIT statement do?
- Phantom Reads occur when:
- 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?
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)